Swarming on random graphs. II
From MaRDI portal
Publication:2342074
DOI10.1007/s10955-014-0923-0zbMath1316.82020OpenAlexW1999082292MaRDI QIDQ2342074
James H. von Brecht, Andrea L. Bertozzi, Benjamin Sudakov
Publication date: 8 May 2015
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-014-0923-0
Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Animal behavior (92D50)
Related Items (2)
The Mean Field Equation for the Kuramoto Model on Graph Sequences with Non-Lipschitz Limit ⋮ Weakly interacting particle systems on inhomogeneous random graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new model for self-organized dynamics and its flocking behavior
- On the spectra of general random graphs
- Large scale dynamics of the persistent turning Walker model of fish behavior
- Do travelling band solutions describe cohesive swarms? An investigation for migratory locusts
- Phase transitions in self-driven many-particle systems and related nonequilibrium models: a network approach
- Modeling the aggregative behavior of ants of the species Polyergus rufescens
- Communication and synchronization in disconnected networks with dynamic topology: Moving neighborhood networks
- Connected components in random graphs with given expected degree sequences
- Swarming on random graphs
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Formation of clumps and patches in self-aggregation of finite-size particles
- Universally optimal distribution of points on spheres
- Asymptotics for minimal discrete energy on the sphere
- Sensor Networks With Random Links: Topology Design for Distributed Consensus
- The Spectra of Random Graphs with Given Expected Degrees
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Agreement over random networks
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Emergent Behavior in Flocks
- Consensus Seeking Over Random Weighted Directed Graphs
- Distributed multi‐vehicle coordinated control via local information exchange
- Spectral techniques applied to sparse random graphs
- The average distances in random graphs with given expected degrees
This page was built for publication: Swarming on random graphs. II
