Majority dynamics on sparse random graphs

DOI10.1002/rsa.21139zbMath1522.05419arXiv2105.12709OpenAlexW3165479222MaRDI QIDQ6074720

No author found.

Publication date: 12 October 2023

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

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

zbMATH Keywords

Erdős-Rényi random graphmajority dynamics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
• Some inequalities relating to the partial sum of binomial probabilities
• Periodic behaviour of generalized threshold functions
• Best response dynamics on random graphs
• Majority model on random regular graphs
• Opinion exchange dynamics
• Central limit theorem for majority dynamics: bribing three voters suffices
• Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs
• Anticoncentration for subgraph statistics
• Opinion Forming in Erdös-Rényi Random Graph and Expanders
• Color War: Cellular Automata with Majority-Rule
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Majority dynamics on sparse random graphs