Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.
Bounds on thel 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality.Transactions of the American mathematical society, 309(2):557–580
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Disjointness with Applications to Reversible Markov Chains
Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.