Random walk centrality and a partition of Kemeny’s constant
From MaRDI portal
Publication:2828814
DOI10.1007/s10587-016-0291-9zbMath1424.15061OpenAlexW2531672002MaRDI QIDQ2828814
Publication date: 26 October 2016
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/145870
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Transition functions, generators and resolvents (60J35) Stochastic matrices (15B51)
Related Items (4)
Estimating random walk centrality in networks ⋮ Markov fundamental tensor and its applications to network analysis ⋮ A Structured Condition Number for Kemeny's Constant ⋮ Kemeny's constant for a graph with bridges
Cites Work
- Unnamed Item
- Unnamed Item
- Non-negative matrices and Markov chains. 2nd ed
- On a Question Concerning Condition Numbers for Markov Chains
- Sensitivity of the Stationary Distribution of a Markov Chain
- Kemeny's Constant and the Random Surfer
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
- Generalized Inverses of Linear Transformations
This page was built for publication: Random walk centrality and a partition of Kemeny’s constant
