Flocking of the Cucker-Smale and Motsch-Tadmor models on general weighted digraphs via a probabilistic method
Adrien Jean Cotil (MISTEA)

TL;DR
This paper introduces a probabilistic approach to analyze flocking behavior in Cucker-Smale and Motsch-Tadmor models on weighted directed graphs, improving existing flocking conditions and characterizing asymptotic speeds.
Contribution
It presents a novel probabilistic method for studying flocking on general weighted digraphs, refining flocking conditions, and characterizing asymptotic speeds, especially under hierarchical leadership.
Findings
Flocking results are established under four assumptions on the interaction matrix.
Improved flocking conditions for scrambling and reversible measure cases.
Flocking can occur regardless of initial conditions under hierarchical leadership.
Abstract
In this paper, we discuss the flocking phenomenon for the Cucker-Smale and Motsch-Tadmor models in continuous time on a general oriented and weighted graph with a general communication function. We present a new approach for studying this problem based on a probabilistic interpretation of the solutions. We provide flocking results under four assumptions on the interaction matrix and we highlight how they relate to the convergence in total variation of a certain Markov jump process. Indeed, we refine previous results on the minimal case where the graph admits a unique closed communication class. Considering the two particular cases where the adjacency matrix is scrambling or where it admits a positive reversible measure, we improve the flocking condition obtained for the minimal case. In the last case, we characterise the asymptotic speed. We also study the hierarchical leadership case…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
