Proves connectivity of colored graph spaces under color-preserving switches, enabling irreducible Markov chains and generalizing 1990s hypersimplex triangulations, while noting that move 1-norms grow with colors for simple graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Irreducible Markov Chains on spaces of graphs with fixed degree-color sequences
Proves connectivity of colored graph spaces under color-preserving switches, enabling irreducible Markov chains and generalizing 1990s hypersimplex triangulations, while noting that move 1-norms grow with colors for simple graphs.