The majority action on infinite graphs: Strings and puppets

DOI10.1016/S0012-365X(99)00228-9zbMath0953.93063OpenAlexW2063074095MaRDI QIDQ1974519

Ron Holzman, Yuval Ginosar

Publication date: 29 January 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00228-9

zbMATH Keywords

graphinfinite graphconnected graphmajority actionpuppet

Mathematics Subject Classification ID

Lyapunov and storage functions (93D30) Asymptotic stability in control theory (93D20) Structural characterization of families of graphs (05C75)

Related Items (10)

Central limit theorem for majority dynamics: bribing three voters suffices ⋮ Percolation in majority dynamics ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Triggering cascades on undirected connected graphs ⋮ Majority dynamics with one nonconformist ⋮ Positive expansiveness versus network dimension in symbolic dynamical systems ⋮ Scaling limits of the Schelling model ⋮ Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs ⋮ Majority dynamics and the retention of information ⋮ Majority dynamics and the median process: connections, convergence and some new conjectures

This page was built for publication: The majority action on infinite graphs: Strings and puppets