Stochastic matrix; Stationary vector; Directed graph.
Given a strongly connected directed graph D, let S_D denote the set of all stochastic matrices whose directed graph is a spanning subgraph of D. We consider the problem of completely describing the set of stationary vectors of irreducible members of S_D. Results from the area of convex polytopes and an association of each matrix with an undirected bipartite graph are used to derive conditions which must be satisfied by a positive probability vector x in order for it to be admissible as a stationary vector of some matrix in S_D. Given some admissible vector x, the set of matrices in S_D that possess x as a stationary vector is also characterised.
Breen, Jane and Kirkland, Steve.
"Stationary vectors of stochastic matrices subject to combinatorial constraints",
Electronic Journal of Linear Algebra,