Matrices with zero row sums, tree theorems and a Markov chain on trees
DOI10.1090/CONM/668/13397zbMATH Open1415.05103OpenAlexW4229530113MaRDI QIDQ5225282FDOQ5225282
Authors: Ph. Feinsilver
Publication date: 19 July 2019
Published in: Probability on Algebraic and Geometric Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/668/13397
Recommendations
- A proof of the Markov chain tree theorem
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
- Counting trees with random walks
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Matrices over function rings in one or more variables (15A54)
Cites Work
Cited In (2)
This page was built for publication: Matrices with zero row sums, tree theorems and a Markov chain on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225282)