Directed forests and the constancy of Kemeny's constant

DOI10.1007/s10801-019-00919-1zbMath1469.60234OpenAlexW2989256151WikidataQ126852485 ScholiaQ126852485MaRDI QIDQ2025144

Stephen J. Kirkland

Publication date: 11 May 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-019-00919-1

zbMATH Keywords

Markov chainKemeny's constantall minors matrix tree theorem

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Oriented spanning trees and stationary distribution of digraphs ⋮ Bounds on Kemeny's constant of trees with a prescribed matching number ⋮ Kemeny's constant for a graph with bridges

Cites Work

• Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Why is Kemeny’s constant a constant?
• Estimating a probability using finite memory
• Unnamed Item
• Unnamed Item

This page was built for publication: Directed forests and the constancy of Kemeny's constant