Load balancing for Markov chains with a specified directed graph

DOI10.1080/03081087.2013.837050zbMath1317.15033OpenAlexW2077279026MaRDI QIDQ2929487

Stephen J. Kirkland

Publication date: 12 November 2014

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

Full work available at URL: https://doi.org/10.1080/03081087.2013.837050

zbMATH Keywords

nonnegative matrixnonlinear programmingMarkov chaindirected graphstochastic matrixirreducible matrixstationary distribution vector

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20) Stochastic matrices (15B51)

Related Items (3)

The minimum coefficient of ergodicity for a Markov chain with a given directed graph ⋮ Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs ⋮ A big-data model for multi-modal public transportation with application to macroscopic control and optimisation

Cites Work

• Unnamed Item
• Fastest expected time to mixing for a Markov chain on a directed graph
• Primitive digraphs with the largest scrambling index
• Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
• Sensitivity analysis of discrete Markov chains via matrix calculus
• Non-negative matrices and Markov chains.
• A Google-like model of road network dynamics and its application to regulation and control
• Combinatorial Matrix Theory
• Nonlinear Programming

This page was built for publication: Load balancing for Markov chains with a specified directed graph