The Role of Kemeny's Constant in Properties of Markov Chains
From MaRDI portal
Publication:5419650
DOI10.1080/03610926.2012.741742zbMath1398.60083arXiv1208.4716OpenAlexW1999028753MaRDI QIDQ5419650
Publication date: 11 June 2014
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.4716
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Spectral analysis for weighted tree-like fractals, The Hitting Time of Multiple Random Walks, Kemeny's Constant And An Analogue Of Braess' Paradox For Trees, Hitting time quasi-metric and its forest representation, Kemeny's constant and the effective graph resistance, On Kemeny's constant for trees with fixed order and diameter, On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival, Modeling spatial networks by contact graphs of disk packings, The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications, Spectral analysis of weighted neighborhood networks, Kemeny's constant for countable Markov chains, Kemeny's constant for several families of graphs and real-world networks, On the normalized Laplacians with some classical parameters involving graph transformations, Why is Kemeny’s constant a constant?, Analysis of Markov Influence Graphs, Exact results for the first-passage properties in a class of fractal networks, The normalized Laplacian spectrum of subdivisions of a graph, On the spectrum of the normalized Laplacian of iterated triangulations of graphs, Large deviations for the skew-detailed-balance lifted-Markov processes to sample the equilibrium distribution of the Curie–Weiss model, On the Normalized Laplacian Spectrum of Some Graphs, Distributed optimization with information-constrained population dynamics, Expected hitting times for random walks on quadrilateral graphs and their applications, Kemeny's function for Markov chains and Markov renewal processes, Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters, Spectral analysis for weighted iterated q-triangulation networks, SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, Energy and Randić energy of special graphs, Why the Kemeny time is a constant
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fastest expected time to mixing for a Markov chain on a directed graph
- The Kemeny constant for finite homogeneous ergodic Markov chains
- Random walks and the effective resistance of networks
- Variances of first passage times in a Markov chain with applications to mixing times
- On resistance-distance and Kirchhoff index
- A note on expected hitting times for birth and death chains
- Generalized inverses and their application to applied probability problems
- Mixing times with applications to perturbed Markov chains
- The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- Kemeny's Constant and the Random Surfer
- THE DISTRIBUTION OF MIXING TIMES IN MARKOV CHAINS
- On the moments of Markov renewal processes
- Perturbation theory and finite Markov chains
