Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 36 min ago
PreprintarXiv licencearXiv

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

Abstract

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.

Related

  1. Mean-variance portfolio selection: connections between mean-field systems and forward-backward stochastic systems under initial-terminal cost coupling
    Xun Li, Hongyu Shi, Zhen Wu
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
  2. Target alignment, dilution and forecast selection when cross-sectional forecasts share a common target
    Masoud Soleimani
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  3. VGAS: Variance-Reduced Guidance and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion
    Kwanyoung Kim
    arXivPreprintCC BY 4.0Full textBioinformatics & computational biologyStatisticsarXiv
  4. Terminal Ambiguity Geometry for Finite-Dimensional Algebras
    Joe Gildea
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Silent Alignment in Two-Layer Linear Networks: A High-Dimensional Perspective
    Simon Martin, Francis Bach, Giulio Biroli
    HALPreprintCC BY 4.0Full textStatisticsHALarXiv
BibTeX
@misc{chen2026exact,
  title = {{Exact Fragmentation and Terminal-Cluster Selection in One-Dimensional Finite-Range Normalized Alignment}},
  author = {Jiangning Chen},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.07992},
  eprint = {2609.07992},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.07992},
}
RIS
TY  - UNPB
TI  - Exact Fragmentation and Terminal-Cluster Selection in One-Dimensional Finite-Range Normalized Alignment
AU  - Jiangning Chen
PY  - 2026
DA  - 2026/09/20
PB  - arXiv
DO  - 10.48550/arxiv.2609.07992
UR  - https://arxiv.org/abs/2609.07992
AB  - 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.
ER  -