Rapid social connectivity
DOI10.1214/19-EJP294zbMath1419.82053arXiv1608.07621OpenAlexW2510986799MaRDI QIDQ2631858
Jonathan Hermon, Itai Benjamini
Publication date: 16 May 2019
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07621
Social networks; opinion dynamics (91D30) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Percolation (82B43) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Random walks on graphs (05C81)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Mixing time bounds via the spectral profile
- Recurrence and transience for the frog model on trees
- Frogs on trees?
- Phase transition for the frog model
- The shape theorem for the frog model
- Percolation on finite graphs and isoperimetric inequalities.
- On an epidemic model on finite graphs
- The social network model on infinite graphs
- The exclusion process mixes (almost) faster than independent particles
- The spread of a rumor or infection in a moving population
- A shape theorem for the spread of an infection
- Sensitivity of Mixing Times in Eulerian Digraphs
- Balls and bins: A study in negative dependence
- Branching and tree indexed random walks on fractals
- Frogs in random environment
This page was built for publication: Rapid social connectivity
