Edge flipping in graphs

DOI10.1016/J.AAM.2011.06.002MaRDI QIDQ651046zbMATH OpenOpenAlexFDO

Authors Fan Chung, Ron 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

graphseigenvaluesstationary distributionvoter modeledge flippingleft-regular bandTsetlin library random walk

Mathematics Subject Classification ID

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

Recommendations

• Edge flipping in the complete graph
• Random walks on colored graphs
• Random coloring evolution on graphs
• Random Seidel switching on graphs
• scientific article; zbMATH DE number 3928066

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 2070260 (Why is no real title available?)
• scientific article; zbMATH DE number 3045112 (Why is no real title available?)
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• A model for spatial conflict
• An exact formula for the move-to-front rule for self-organizing lists
• Analytic combinatorics
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Functions of random walks on hyperplane arrangements
• On the matrix occurring in a linear search problem
• Random majority percolation
• Random walks and hyperplane arrangements
• Semigroups, rings, and Markov chains
• The complexity of counting in sparse, regular, and planar graphs

Cited in

(25)

• Random walks on rings and modules
• A note on an alternating upper bound for random walks on semigroups
• Enumerative theory for the Tsetlin library
• Random Seidel switching on graphs
• Mixing time bounds for edge flipping on regular graphs
• Semigroups embeddable in hyperplane face monoids.
• scientific article; zbMATH DE number 3928066 (Why is no real title available?)
• Random coloring evolution on graphs
• Upper Bounds on Mixing Time of Finite Markov Chains
• Hypergraph Coloring Games and Voter Models
• Simplicity of augmentation submodules for transformation monoids
• Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
• My journey into noncommutative lattices and their theory
• Combinatorial topology and the global dimension of algebras arising in combinatorics
• Prominent examples of flip processes
• Character theory of monoids over an arbitrary field.
• Directed nonabelian sandpile models on trees
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
• Edge flipping in the complete graph
• Mixing time for Markov chain on linear extensions
• A forest building process on simple graphs
• Harmonic analysis on graphs via Bratteli diagrams and path-space measures
• From flip processes to dynamical systems on graphons
• Interview with Anne Schilling
• Unified theory for finite Markov chains

This page was built for publication: Edge flipping in graphs

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