Voter models on subcritical scale‐free random graphs
From MaRDI portal
Publication:6074869
DOI10.1002/rsa.21107arXiv1911.13187OpenAlexW4286715992MaRDI QIDQ6074869
Marcel Ortgiese, Unnamed Author
Publication date: 19 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.13187
voter modelinteracting particle systemsscale-free networksinhomogeneous random graphsrandom walks on random graphs
Statistical mechanics, structure of matter (82-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean field conditions for coalescing random walks
- Cover time of a random graph with given degree sequence
- Intersection and mixing times for reversible chains
- Condensation in nongeneric trees
- The largest component in a subcritical random graph with a power law degree distribution
- Probability approximations via the Poisson clumping heuristic
- Random walks on the random graph
- Dynamics on and of complex networks. Volume 2. Applications to time-varying dynamical systems
- Anatomy of the giant component: the strictly supercritical regime
- Random Graphs and Complex Networks
- The mixing time of the giant component of a random graph
- Time to Stationarity for a Continuous-Time Markov Chain
- Discordant Voting Processes on Finite Graphs
- On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract
- The phase transition in inhomogeneous random graphs
- On the coalescence time of reversible random walks
- On a conditionally Poissonian graph process
- Probability: A Graduate Course
- On the convergence of densities of finite voter models to the Wright-Fisher diffusion
This page was built for publication: Voter models on subcritical scale‐free random graphs
