Stationary vectors of stochastic matrices subject to combinatorial constraints

• DOI: 10.13001/1081-3810.2988
• Publication Date: 2015-09-15T07:13:18Z
• Authors: Jane Breen; Steve Kirkland
• Keywords: Matrix (chemical analysis)

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