Discordant edges for the voter model on regular random graphs

zbMATH Open1542.05156MaRDI QIDQ6564541FDOQ6564541

Authors: Luca Avena, Rangel Baldasso, Rajat Subhra Hazra, F. den Hollander, Matteo Quattropani 

Publication date: 1 July 2024

Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Recommendations

• Bounds on the Voter Model in Dynamic Networks
• Threshold behaviour of discordant voting on the complete graph
• Discordant Voting Processes on Finite Graphs
• Discordant voting processes on finite graphs

zbMATH Keywords

random walksconcentrationvoter modelregular random graphdiscordant edges

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81) Voting theory (91B12)

Cites Work

• Inequalities for rare events in time-reversible Markov chains. I.
• Probability Models for DNA Sequence Evolution
• Ergodic theorems for weakly interacting infinite systems and the voter model
• A model for spatial conflict
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• Mean field conditions for coalescing random walks
• Multiple random walks in random regular graphs
• A proof of Alon’s second eigenvalue conjecture and related problems
• Cutoff phenomena for random walks on random regular graphs
• The Cover Time of Random Regular Graphs
• Title not available (Why is that?)
• Finite particle systems and infection models
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Probability
• On the long term behavior of some finite particle systems
• Voter models on subcritical scale‐free random graphs
• On the convergence of densities of finite voter models to the Wright-Fisher diffusion
• Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
• Mean field behavior during the big bang regime for coalescing random walks
• A probabilistic proof of Cooper \& Frieze's ``First Visit Time Lemma
• On the meeting of random walks on random DFA

Cited In (2)

• Meeting, coalescence and consensus time on random directed graphs
• Discursive voter models on the supercritical scale-free network

This page was built for publication: Discordant edges for the voter model on regular random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564541)