Discursive voter models on the supercritical scale-free network

DOI10.1137/22M1544373MaRDI QIDQ6490282

Unnamed Author

Publication date: 23 April 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

voter modelinteracting particle systemsinhomogeneous random graphsrandom walk mixingrank-one scale-free networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean field conditions for coalescing random walks
• Cover time of a random graph with given degree sequence
• Probability approximations via the Poisson clumping heuristic
• An old approach to the giant component problem
• 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
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• Chernoff and Berry–Esséen inequalities for Markov processes
• Discordant Voting Processes on Finite Graphs
• A model for spatial conflict
• The phase transition in inhomogeneous random graphs
• Probability Inequalities for Sums of Bounded Random Variables
• The diameter of sparse random graphs
• On a conditionally Poissonian graph process
• On the convergence of densities of finite voter models to the Wright-Fisher diffusion
• Voter models on subcritical scale‐free random graphs

This page was built for publication: Discursive voter models on the supercritical scale-free network