Edge flipping in graphs

DOI10.1016/j.aam.2011.06.002zbMath1234.05210OpenAlexW2095754162MaRDI QIDQ651046

Fan R. K. Chung, Ronald L. Graham

Publication date: 8 December 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2011.06.002

zbMATH Keywords

eigenvaluesgraphsstationary distributionvoter modeledge flippingleft-regular bandTsetlin library random walk

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Random walks on graphs (05C81)

Related Items

Upper Bounds on Mixing Time of Finite Markov Chains, Harmonic analysis on graphs via Bratteli diagrams and path-space measures, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, A forest building process on simple graphs, A note on an alternating upper bound for random walks on semigroups, Mixing time for Markov chain on linear extensions, Mixing time bounds for edge flipping on regular graphs, Combinatorial topology and the global dimension of algebras arising in combinatorics, Semigroups embeddable in hyperplane face monoids., Unified theory for finite Markov chains, Edge flipping in the complete graph, Random walks on rings and modules, Hypergraph Coloring Games and Voter Models, My journey into noncommutative lattices and their theory, Simplicity of augmentation submodules for transformation monoids, Markov chains, ${\mathscr R}$-trivial monoids and representation theory, Directed nonabelian sandpile models on trees, Character theory of monoids over an arbitrary field.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functions of random walks on hyperplane arrangements
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Random walks and hyperplane arrangements
• Semigroups, rings, and Markov chains
• An exact formula for the move-to-front rule for self-organizing lists
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• Random majority percolation
• On the matrix occurring in a linear search problem
• A model for spatial conflict