Finite-time flocking of an infinite set of Cucker-Smale particles with sublinear velocity couplings
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915794250629120 |
|---|---|
| author | Ha, Seung-Yeal Wang, Xinyu Zeng, Fanqin |
| author_facet | Ha, Seung-Yeal Wang, Xinyu Zeng, Fanqin |
| contents | We study finite-time flocking for an infinite set of Cucker-Smale particles with sublinear velocity coupling under fixed and switching sender networks. For this, we use a component-wise diameter framework and exploit sub-linear dissipation mechanisms, and derive sufficient conditions for finite-time flocking equipped with explicit alignment-time estimate. For a fixed sender network, we establish component-wise finite-time flocking results under both integrable and non-integrable communication weights. When communication weight function is non-integrable, finite-time flocking is guaranteed for any bounded initial configuration. We further extend the flocking analysis to switching sender networks and show that finite-time flocking persists under mild assumptions on the cumulative influence of time-varying sender weights. The proposed framework is also applicable to both finite and infinite systems, and it yields alignment-time estimates that do not depend on the number of agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_11555 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Finite-time flocking of an infinite set of Cucker-Smale particles with sublinear velocity couplings Ha, Seung-Yeal Wang, Xinyu Zeng, Fanqin Dynamical Systems We study finite-time flocking for an infinite set of Cucker-Smale particles with sublinear velocity coupling under fixed and switching sender networks. For this, we use a component-wise diameter framework and exploit sub-linear dissipation mechanisms, and derive sufficient conditions for finite-time flocking equipped with explicit alignment-time estimate. For a fixed sender network, we establish component-wise finite-time flocking results under both integrable and non-integrable communication weights. When communication weight function is non-integrable, finite-time flocking is guaranteed for any bounded initial configuration. We further extend the flocking analysis to switching sender networks and show that finite-time flocking persists under mild assumptions on the cumulative influence of time-varying sender weights. The proposed framework is also applicable to both finite and infinite systems, and it yields alignment-time estimates that do not depend on the number of agents. |
| title | Finite-time flocking of an infinite set of Cucker-Smale particles with sublinear velocity couplings |
| topic | Dynamical Systems |
| url | https://arxiv.org/abs/2602.11555 |