The social network model on infinite graphs

DOI10.1214/19-AAP1520zbMath1459.60145arXiv1610.04293OpenAlexW3033274752MaRDI QIDQ2192744

Allan Sly, Jonathan Hermon, Ben Morris, Chuan Qin

Publication date: 17 August 2020

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random walkspercolationphase transitionamenabilitysocial networkinfinite cluster

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) 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)

Related Items (5)

Rapid social connectivity ⋮ On an epidemic model on finite graphs ⋮ Frogs on trees? ⋮ COVER TIME FOR THE FROG MODEL ON TREES ⋮ Mean field behavior during the big bang regime for coalescing random walks

Cites Work

• Unnamed Item
• From transience to recurrence with Poisson tree frogs
• Is the critical percolation probability local?
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
• Recurrence and transience for the frog model on trees
• The shape theorem for the frog model
• Random interlacements and amenability
• On an epidemic model on finite graphs
• The spread of a rumor or infection in a moving population
• Rapid social connectivity
• Branching and tree indexed random walks on fractals
• Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
• Frogs in random environment

This page was built for publication: The social network model on infinite graphs