Stationary vectors of stochastic matrices subject to combinatorial constraints

DOI10.13001/1081-3810.2988zbMATH Open1321.15054OpenAlexW573636968MaRDI QIDQ5502154FDOQ5502154

Authors: Jane Breen, S. J. Kirkland 

Publication date: 17 August 2015

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.2988

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Load balancing for Markov chains with a specified directed graph
• Digraph-based conditioning for Markov chains
• Row-stochastic matrices with a common left fixed vector
• Column sums and the conditioning of the stationary distribution for a stochastic matrix
• Graphes et algorithme de calcul de probabilités stationnaires d'un processus markovien discret. (Graphs and algorithm for the computation of stationary probabilities of a discrete Markov process)

zbMATH Keywords

stochastic matrixdirected graphstationary vector

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51)

Cited In (5)

• Title not available (Why is that?)
• Perturbation and Inverse Problems of Stochastic Matrices
• Explicit stationary distributions for compositions of random functions and products of random matrices
• Assigning stationary distributions to sparse stochastic matrices
• Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs

This page was built for publication: Stationary vectors of stochastic matrices subject to combinatorial constraints

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