Fastest expected time to mixing for a Markov chain on a directed graph
type: Item
instance of: scholarly article
title: Fastest expected time to mixing for a Markov chain on a directed graph
zbMATH Open document ID: 1209.05111
published in: Linear Algebra and its Applications
publication date: 2010-11-05T00:00:00Z
full work available at URL: SK min kemeny final.pdf
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 15A42
Mathematics Subject Classification ID: 15B51
zbMATH DE Number: 5811019
zbMATH Keywords: stochastic matrix
zbMATH Keywords: directed graph
zbMATH Keywords: Kemeny constant
author: S. J. Kirkland
MaRDI profile type: Publication
OpenAlex ID: W2057847103
cites work: Fastest Mixing Markov Chain on a Graph
cites work: Combinatorial matrix theory
cites work: Q4002435
cites work: The Kemeny constant for finite homogeneous ergodic Markov chains
cites work: Q3158579
cites work: Q5834412
cites work: Matrix Analysis
cites work: Mixing times with applications to perturbed Markov chains
cites work: Q3262596
cites work: The Group Inverse Associated with an Irreducible Periodic Nonnegative Matrix
cites work: A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain
cites work: Kemeny's Constant and the Random Surfer
cites work: Q4273847
cites work: Non-negative matrices and Markov chains. 2nd ed
DOI: 10.1016/J.LAA.2010.07.016
description: scientific article; zbMATH DE number 5811019