The following pages link to Edge flipping in graphs (Q651046):
Displaying 20 items.
- A note on an alternating upper bound for random walks on semigroups (Q403558) (← links)
- Semigroups embeddable in hyperplane face monoids. (Q467529) (← links)
- Edge flipping in the complete graph (Q492703) (← links)
- Combinatorial topology and the global dimension of algebras arising in combinatorics (Q907273) (← links)
- A forest building process on simple graphs (Q1686006) (← links)
- Unified theory for finite Markov chains (Q1735485) (← links)
- Random walks on rings and modules (Q1985354) (← links)
- Simplicity of augmentation submodules for transformation monoids (Q2042297) (← links)
- Directed nonabelian sandpile models on trees (Q2339194) (← links)
- Character theory of monoids over an arbitrary field. (Q2344836) (← links)
- Mixing time for Markov chain on linear extensions (Q2680908) (← links)
- Hypergraph Coloring Games and Voter Models (Q4985349) (← links)
- Upper Bounds on Mixing Time of Finite Markov Chains (Q5055645) (← links)
- Harmonic analysis on graphs via Bratteli diagrams and path-space measures (Q5061511) (← links)
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry (Q5063338) (← links)
- My journey into noncommutative lattices and their theory (Q5198035) (← links)
- Markov chains, ${\mathscr R}$-trivial monoids and representation theory (Q5246508) (← links)
- Mixing time bounds for edge flipping on regular graphs (Q6148878) (← links)
- Enumerative theory for the Tsetlin library (Q6565648) (← links)
- Interview with Anne Schilling (Q6659954) (← links)
