Discursive voter models on the supercritical scale-free network

DOI10.1137/22M1544373MaRDI QIDQ6490282zbMATH OpenFDO

Authors

Publication date 23 April 2024

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

zbMATH Keywords

interacting particle systemsvoter modelinhomogeneous random graphsrandom walk mixingrank-one scale-free networks

Mathematics Subject Classification ID

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)

Recommendations

• Voter model on networks partitioned into two cliques of arbitrary sizes
• Effect of network topology on the ordering dynamics of voter models
• Discordant edges for the voter model on regular random graphs
• A generalized voter model on complex networks
• Bounds on the Voter Model in Dynamic Networks

Cites work

• scientific article; zbMATH DE number 3198427 (Why is no real title available?)
• A model for spatial conflict
• An old approach to the giant component problem
• Anatomy of the giant component: the strictly supercritical regime
• Chernoff and Berry–Esséen inequalities for Markov processes
• Cover time of a random graph with given degree sequence
• Discordant Voting Processes on Finite Graphs
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mean field conditions for coalescing random walks
• On a conditionally Poissonian graph process
• On the convergence of densities of finite voter models to the Wright-Fisher diffusion
• Probability Inequalities for Sums of Bounded Random Variables
• Probability approximations via the Poisson clumping heuristic
• Random graphs and complex networks. Volume 1
• The diameter of sparse random graphs
• 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
• The phase transition in inhomogeneous random graphs
• The probabilistic method
• Time to Stationarity for a Continuous-Time Markov Chain
• Voter models on subcritical scale‐free random 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)