Interacting particle systems as stochastic social dynamics

DOI10.3150/12-BEJSP04zbMath1278.60141arXiv1309.6766MaRDI QIDQ373520

David J. Aldous

Publication date: 17 October 2013

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6766

zbMATH Keywords

Markov chain; voter model; social network; interacting particle system; epidemic

Mathematics Subject Classification ID

91D30: Social networks; opinion dynamics

60K35: Interacting random processes; statistical mechanics type models; percolation theory

Related Items

Theory and Practice of Discrete Interacting Agents Models, The front of the epidemic spread and first passage percolation, Mixing of the averaging process and its discrete dual on finite-dimensional geometries, Distributed Averaging in Opinion Dynamics, Information diffusion in social sensing, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, Weak atomic convergence of finite voter models toward Fleming-Viot processes, Consensus and voting on large graphs: an application of graph limit theory, Weakly interacting particle systems on inhomogeneous random graphs, Deterministic versus stochastic consensus dynamics on graphs, Time-varying network models, Random-batch method for multi-species stochastic interacting particle systems, Book Review: Probability on graphs: random processes on graphs and lattices, Inhomogeneous Financial Networks and Contagious Links, Agent-based modeling: Population limits and large timescales

Cites Work

• Exponential extinction time of the contact process on finite graphs
• A lecture on the averaging process
• Information, possible worlds and the cooptation of scepticism
• Asymptotic behavior of Aldous' gossip process
• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• Exponential concentration for first passage percolation through modified Poincaré inequalities
• Connected spatial networks over random points and a route-length statistic
• Diffusive clustering in the two dimensional voter model
• The contact process on a finite set. II
• Probability approximations via the Poisson clumping heuristic
• Additive and cancellative interacting particle systems
• The flooding time in random graphs
• The stepping stone model. II: Genealogies and the infinite sites model
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• First passage percolation on random graphs with finite mean degrees
• Logarithmic Sobolev inequalities for finite Markov chains
• When Knowing Early Matters: Gossip, Percolation and Nash Equilibria
• Coalescing random walks and voting on graphs
• Ordering in voter models on networks: exact reduction to a single-coordinate diffusion
• Gossip Algorithms
• Recent progress in coalescent theory
• Probability Models for DNA Sequence Evolution
• Proof of Aldous’ spectral gap conjecture
• Some Inequalities for Reversible Markov Chains
• The Structure and Function of Complex Networks
• A stochastic complex network model
• The cutoff phenomenon in finite Markov chains.
• Random Walks on Infinite Graphs and Groups
• On the coalescence time of reversible random walks
• The dead leaves model: a general tessellation modeling occlusion
• A SIMPLE STOCHASTIC EPIDEMIC
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item