Loop-erased walks and total positivity
Publication:2716150
DOI10.1090/S0002-9947-01-02824-0zbMath0973.15014arXivmath/0004083MaRDI QIDQ2716150
Publication date: 6 June 2001
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0004083
Markov chainsBrownian motionnonnegative matricestotal positivityhitting probabilityresistor networkloop-erased walkacyclic directed networksplanar directed weighted graphs
Brownian motion (60J65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Discrete potential theory (31C20)
Related Items (27)
Cites Work
- Coincidence probabilities
- Circular planar graphs and resistor networks
- Choosing a spanning tree for the integer lattice uniformly
- On the Karlin-McGregor theorem and applications
- Uniform spanning forests
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Totally nonnegative and oscillatory elements in semisimple groups
- Special values of multiple polylogarithms
- Finding the conductors in circular networks from boundary measurements
- On the Vector Representations of Induced Matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Loop-erased walks and total positivity