Loop-erased walks and total positivity
From MaRDI portal
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
Conformal invariance of planar loop-erased random walks and uniform spanning trees. ⋮ On multiple SLE for the FK-Ising model ⋮ Girsanov's transformation for \(\text{SLE}(\kappa,\rho)\) processes, intersection exponents and hiding exponents. ⋮ Euler integrals for commuting SLEs ⋮ Scaling limit of the loop-erased random walk Green's function ⋮ Edge vectors on plabic networks in the disk and amalgamation of totally non-negative Grassmannians ⋮ The planar Ising model and total positivity ⋮ Hitting matrix and domino tiling with diagonal impurities ⋮ Boundary measurement matrices for directed networks on surfaces ⋮ Positivity for Gaussian graphical models ⋮ Boundary correlations in planar LERW and UST ⋮ Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity ⋮ Crossing probabilities of multiple Ising interfaces ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Tiling by rectangles and alternating current ⋮ Schramm’s formula for multiple loop-erased random walks ⋮ Topics in loop measures and the loop-erased walk ⋮ Trek separation for Gaussian graphical models ⋮ SLE and Virasoro representations: fusion ⋮ Loop-erased walks and random matrices ⋮ A principle for converting Lindström-type lemmas to Stembridge-type theorems, with applications to walks, groves, and alternating flows ⋮ Boundary partitions in trees and dimers ⋮ Kasteleyn theorem, geometric signatures and KP-II divisors on planar bipartite networks in the disk ⋮ Conformal blocks, \(q\)-combinatorics, and quantum group symmetry ⋮ Conformal invariance and $2D$ statistical physics ⋮ Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs ⋮ Watermelons on the half-plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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