Walkers Scattered Across Street Networks: A Small Step Toward Completely Decentralized Gatherings

How to meet if we are dispersed in a city? Coordinating, by exchanging our positions thanks to modern means of communication, seems easy. But how to achieve the same result if communications are impossible and no meeting point is identifiable? This is the case, for example, during a repressed social movement or a blackout. The objective of my thesis is to find the key ingredients for a movement tactic to ensure that walkers will meet in the same place, regardless of their starting positions. I therefore model them as random walks, on a street network, biased by various observables. Having identified sufficient rules to guarantee the formation of such groups, I subsequently improved this model, and obtained more effective tactics, by incorporating a more realistic vision in the walkers. Finally, in the case of countermeasures or crowd movements, I show that these walks offer guarantees regarding the reformation of groups after a dispersion.

Pubblicazioni 2025

• 2025
  • G. Moinard, M. Latapy : “Improving flocking behaviors in street networks with vision”, (2025)
  • G. Moinard, M. Latapy : “Fast and Robust Flocking of Protesters on Street Networks”, (2025)
  • G. Moinard, M. Latapy : “Fast Flocking of Protesters on Street Networks”, Social Networks Analysis and Mining, vol. 15212, Lecture Notes in Computer Science, Rende (CS), Calabria, Italy, pp. 194-203, (Springer Nature Switzerland) (2025)