Voter models on subcritical scale‐free random graphs

DOI10.1002/RSA.21107MaRDI QIDQ6074869zbMATH OpenOpenAlexFDO

Authors Marcel Ortgiese

Publication date 19 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1911.13187

zbMATH Keywords

interacting particle systemsvoter modelscale-free networksinhomogeneous random graphsrandom walks on random graphs

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX) Statistical mechanics, structure of matter (82-XX)

Abstract: The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph. Moreover, we generalise the model to include a `temperature' parameter. The interplay between the temperature and the structure of the random graph leads to a very rich phase diagram, where in the different phases different parts of the underlying geometry dominate the time to consensus. Finally, we also consider a discursive voter model, where voters discuss their opinions with their neighbours. Our proofs rely on the well-known duality to coalescing random walks and a detailed understanding of the structure of the random graphs.

Cites work

• scientific article; zbMATH DE number 1026574 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• Anatomy of the giant component: the strictly supercritical regime
• Complex graphs and networks
• Condensation in nongeneric trees
• Cover time of a random graph with given degree sequence
• Discordant Voting Processes on Finite Graphs
• Dynamics on and of complex networks. Volume 2. Applications to time-varying dynamical systems
• Intersection and mixing times for reversible chains
• 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 coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract
• On the coalescence time of reversible random walks
• On the convergence of densities of finite voter models to the Wright-Fisher diffusion
• Probability approximations via the Poisson clumping heuristic
• Probability: a graduate course
• Random graph dynamics
• Random graphs and complex networks. Volume 1
• Random walks on the random graph
• The largest component in a subcritical random graph with a power law degree distribution
• The mixing time of the giant component of a random graph
• The phase transition in inhomogeneous random graphs
• Time to Stationarity for a Continuous-Time Markov Chain

Cited in

(7)

• Discordant edges for the voter model on regular random graphs
• Mapping the \(q\)-voter model: from a single chain to complex networks
• Bounds on the Voter Model in Dynamic Networks
• Meeting, coalescence and consensus time on random directed graphs
• scientific article; zbMATH DE number 3980198 (Why is no real title available?)
• Cover and hitting times of hyperbolic random graphs
• Discursive voter models on the supercritical scale-free network

This page was built for publication: Voter models on subcritical scale‐free random graphs

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