Oriented spanning trees and stationary distribution of digraphs (Q6170341): Difference between revisions

A basic problem in the study of random walks on digraphs is to determine the stationary distribution vector, which has also been applied to PageRank algorithms. It is known that every digraph has a biclique partition. By imposing certain conditions, the paper gives reduction formulas for spanning tree enumerators, stationary distribution vectors and Kemeny's constant of digraphs by counting oriented spanning trees in the biclique digraph, and uses biclique partitions to extend the results from line digraphs to general digraphs, and presents biclique partition formulas for counting oriented spanning trees and Eulerian circuits of digraphs.