Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs

DOI10.1016/j.laa.2017.01.034zbMath1359.15028OpenAlexW2582814303MaRDI QIDQ513241

Jane Breen, Stephen J. Kirkland

Publication date: 3 March 2017

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

Full work available at URL: https://doi.org/10.1016/j.laa.2017.01.034

zbMATH Keywords

Markov chaindirected graphstochastic matrixHessenberg matrixmean first passage time

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Stochastic matrices (15B51)

Cites Work

• Unnamed Item
• 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
• Non-negative matrices and Markov chains. 2nd ed
• Mixing times with applications to perturbed Markov chains
• Stationary distributions and mean first passage times of perturbed Markov chains
• Load balancing for Markov chains with a specified directed graph
• A Google-like model of road network dynamics and its application to regulation and control
• Kemeny's Constant and the Random Surfer
• On the Kemeny constant and stationary distribution vector for a Markov chain
• Stationary vectors of stochastic matrices subject to combinatorial constraints
• An introduction to queueing theory. Modeling and analysis in applications.

This page was built for publication: Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs