Load balancing for Markov chains with a specified directed graph

DOI10.1080/03081087.2013.837050MaRDI QIDQ2929487zbMATH OpenOpenAlexFDO

Authors S. 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

Markov chainnonlinear programmingstochastic matrixdirected graphnonnegative matrixirreducible matrixstationary distribution vector

Mathematics Subject Classification ID

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

Recommendations

• Load balancing in hypergraphs
• Discrete load balancing on complete bipartite graphs
• Randomized load balancing on networks with stochastic inputs
• scientific article; zbMATH DE number 975375
• Load balancing and orientability thresholds for random hypergraphs
• Publication:4861740
• Approximate throughput computation of stochastic marked graphs
• Remarks on dynamic load balancing of integer loads and integral graphs

Cites work

• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• A Google-like model of road network dynamics and its application to regulation and control
• Combinatorial Matrix Theory
• Fastest expected time to mixing for a Markov chain on a directed graph
• Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
• Non-negative matrices and Markov chains.
• Nonlinear Programming
• Primitive digraphs with the largest scrambling index
• Sensitivity analysis of discrete Markov chains via matrix calculus

Cited in

(4)

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

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

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