Oriented spanning trees and stationary distribution of digraphs

DOI10.1016/j.aam.2023.102576zbMath1519.05099arXiv2307.01962OpenAlexW4383031813MaRDI QIDQ6170341

Changjiang Bu, Jiang Zhou

Publication date: 12 July 2023

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.01962

zbMATH Keywords

stationary distributionrandom walkmatrix-tree theoremoriented spanning tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Sandpile groups and spanning trees of directed line graphs
• Extreme values of the stationary distribution of random walks on directed graphs
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• A combinatorial Laplacian with vertex weights
• Directed forests and the constancy of Kemeny's constant
• The enumeration of spanning tree of weighted graphs
• On the number of spanning trees of some irregular line graphs
• A Bijective Proof of a Theorem of Knuth
• Local Partitioning for Directed Graphs Using PageRank
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A simple formula for the number of spanning trees of line graphs
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• A Hitting Time Formula for the Discrete Green's Function
• Oriented subtrees of an arc digraph

This page was built for publication: Oriented spanning trees and stationary distribution of digraphs