Load balancing for Markov chains with a specified directed graph
Load balancing for Markov chains with a specified directed graph
Given a strongly directed graph , let be the set of stochastic matrices whose directed graph is a spanning subgraph of . We consider the problem of finding the infimum of as ranges over the set of stationary distribution vectors of irreducible matrices in Using techniques from non-linear programming, combinatorial …