A 1-separation formula for the graph Kemeny constant and Braess edges
From MaRDI portal
Publication:2072215
DOI10.1007/s10910-021-01294-8zbMath1481.05146arXiv2108.01061OpenAlexW3204200502MaRDI QIDQ2072215
Nolan Faught, Adam Knudson, Mark Kempton
Publication date: 26 January 2022
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.01061
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)
Related Items (3)
On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ Kemeny's constant and Wiener index on trees ⋮ Kemeny's constant for a graph with bridges
Cites Work
- Unnamed Item
- The Kemeny constant for finite homogeneous ergodic Markov chains
- Resistance distance in straight linear 2-trees
- The Braess' paradox for pendent twins
- Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
- Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
- Kemeny's Constant and the Random Surfer
- Über ein Paradoxon aus der Verkehrsplanung
This page was built for publication: A 1-separation formula for the graph Kemeny constant and Braess edges
