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 are related 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 where we give a new general flocking condition which allows to deal with the case $ \psi(r)\propto(1+r^2)^{-\beta/2} $ and $ \beta\geq1 $. In a particular case of the Motsch-Tadmor model, we also prove with our method that the flocking phenomenon occurs independently of the initial conditions and the communication function.
Path exits for transhumant livestock are a major problem in many Sub-Saharan African countries. These problems contribute to many community conflicts. Several solutions are currently being studied, including dialogues between stakeholders. In this paper, we propose a numerical approach to address the problem. Based on a commonly accepted model of agent movement, we propose a path simulator to estimate and quantify the risk of exiting the path. This enables quantitative estimation of the exit rates of transhumant animals as a function of the geometric properties of the routes. This model is tested on real transhumance routes in Chad to evaluate the risks of exits along these routes. These new data allow us to better understand the geometric properties on real routes and to evaluate them in terms of exit risk, giving new information to this complex problem. Although our approach does not deal with the whole complexity of this problem, it opens the door to field experimentation with geolocation sensors.
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 where we give a new general flocking condition which allows to deal with the case $\psi(r)\propto(1+r^2)^{-\beta/2}$ and $\beta\geq1$. For the Motsch-Tadmor model under the hierarchical leadership assumption, we exhibit a case where the flocking phenomenon occurs regardless of the initial conditions and the communication function, in particular even if $\beta\geq1$.