Fastest expected time to mixing for a Markov chain on a directed graph

DOI10.1016/J.LAA.2010.07.016zbMATH Open1209.05111OpenAlexW2057847103MaRDI QIDQ603129FDOQ603129

Authors: S. J. Kirkland 

Publication date: 5 November 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.maynoothuniversity.ie/2186/2/SK_min_kemeny_final.pdf

Recommendations

• The role of Kemeny's constant in properties of Markov chains
• On the Kemeny constant and stationary distribution vector for a Markov chain
• Fastest Mixing Markov Chain on a Graph
• Fastest Mixing Markov Chain on a Path
• The Kemeny constant for finite homogeneous ergodic Markov chains

zbMATH Keywords

stochastic matrixdirected graphKemeny constant

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Inequalities involving eigenvalues and eigenvectors (15A42) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic matrices (15B51)

Cites Work

• Matrix Analysis
• Combinatorial matrix theory
• Mixing times with applications to perturbed Markov chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-negative matrices and Markov chains. 2nd ed
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fastest Mixing Markov Chain on a Graph
• Title not available (Why is that?)
• Kemeny's Constant and the Random Surfer
• The Kemeny constant for finite homogeneous ergodic Markov chains
• A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain
• The Group Inverse Associated with an Irreducible Periodic Nonnegative Matrix

Cited In (18)

• Generalized inverses of Markovian kernels in terms of properties of the Markov chain
• The minimum coefficient of ergodicity for a Markov chain with a given directed graph
• Kemeny's constant and an analogue of Braess' paradox for trees
• Kemeny's constant and the effective graph resistance
• Fastest mixing Markov chain problem for the union of two cliques
• The hitting time of multiple random walks
• The role of Kemeny's constant in properties of Markov chains
• Load balancing for Markov chains with a specified directed graph
• Random Walks, Directed Cycles, and Markov Chains
• Alleviating road network congestion: traffic pattern optimization using Markov chain traffic assignment
• Analysis of Markov influence graphs
• A Google-like model of road network dynamics and its application to regulation and control
• On Kemeny's constant and stochastic complement
• Lower bounds for the Estrada index using mixing time and Laplacian spectrum
• On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival
• Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices
• A structured condition number for Kemeny's constant
• Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs

This page was built for publication: Fastest expected time to mixing for a Markov chain on a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603129)