Discursive voter models on the supercritical scale-free network
DOI10.1137/22M1544373MaRDI QIDQ6490282FDOQ6490282
Authors:
Publication date: 23 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
interacting particle systemsvoter modelinhomogeneous random graphsrandom walk mixingrank-one scale-free networks
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81) Interacting particle systems in time-dependent statistical mechanics (82C22)
Cites Work
- Probability approximations via the Poisson clumping heuristic
- Random graphs and complex networks. Volume 1
- Probability Inequalities for Sums of Bounded Random Variables
- The phase transition in inhomogeneous random graphs
- On a conditionally Poissonian graph process
- The probabilistic method
- A model for spatial conflict
- Title not available (Why is that?)
- Mean field conditions for coalescing random walks
- Chernoff and Berry–Esséen inequalities for Markov processes
- Time to Stationarity for a Continuous-Time Markov Chain
- The evolution of the mixing rate of a simple random walk on the giant component of a random graph
- The mixing time of the giant component of a random graph
- Cover time of a random graph with given degree sequence
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- The diameter of sparse random graphs
- An old approach to the giant component problem
- Voter models on subcritical scale‐free random graphs
- On the convergence of densities of finite voter models to the Wright-Fisher diffusion
- Anatomy of the giant component: the strictly supercritical regime
- Discordant Voting Processes on Finite Graphs
This page was built for publication: Discursive voter models on the supercritical scale-free network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490282)