Exact Fragmentation and Terminal-Cluster Selection in One-Dimensional Finite-Range Normalized Alignment

RESUMO

Finite-range alignment can end either in a single flock or in several noninteracting clusters, yet convergence results rarely determine which outcome follows from a given finite-particle state. We study a one-dimensional normalized alignment model with a hard interaction cut-off and obtain exact predictions in an expansive regime. Velocity order is invariant, so pair separations are nondecreasing and the communication graph evolves through finitely many irreversible edge deletions. On each fixed graph, the group inverse of the random-walk Laplacian gives the total relative displacement remaining before relaxation. Comparing this displacement with the available interaction slack selects the next deletion and yields a finite recursion for the complete switching sequence, terminal partition, limiting cluster velocities, and internal geometry. For path configurations, an explicit Green kernel gives a necessary-and-sufficient fragmentation criterion and a sharp critical alignment rate, including asymptotic boundary contact at criticality. A spectral-geometric condition extends the theory to an open set of initially nonordered velocities, while a common self-weight extension covers both self-excluding and self-including local averages. Numerical computations reproduce the thresholds and multi-event cascades. The results provide an exact finite-size theory of fragmentation and terminal state selection for a class of finite-range interacting particle systems.