scientific article; zbMATH DE number 953290

MaRDI QIDQ4718236zbMATH OpenFDO

Authors Robin Pemantle

Publication date 8 July 1997

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

zbMATH Keywords

branching processesresistor networksspanning tree of a graphstationary Markov chains

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• scientific article; zbMATH DE number 1195780
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Random-cluster measures and uniform spanning trees

Cited in

(40)

• On finding most uniform spanning trees
• Choosing a spanning tree for the integer lattice uniformly
• Choosing a random spanning subtree: A case study
• Non-uniform random spanning trees on weighted graphs
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• Random forests and networks analysis
• Two applications of random spanning forests
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Correlation bounds for fields and matroids
• The number of spanning clusters of the uniform spanning tree in three dimensions
• The local limit of uniform spanning trees
• Unions of random trees and applications
• The Green's function on the double cover of the grid and application to the uniform spanning tree trunk
• The distribution of Weierstrass points on a tropical curve
• Shortest spanning trees and a counterexample for random walks in random environments
• Finding the seed of uniform attachment trees
• Fairest edge usage and minimum expected overlap for random spanning trees
• Long-range properties of spanning trees
• Loop erased walks and uniform spanning trees
• Boundary partitions in trees and dimers
• On constructing rational spanning tree edge densities
• Fundamental constants in the theory of two-dimensional uniform spanning trees
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• RANDOM COMPLEXES AND ℓ²-BETTI NUMBERS
• Identities and inequalities for tree entropy
• A tree-based scaling exponent for random cluster models
• scientific article; zbMATH DE number 1984558 (Why is no real title available?)
• Random spanning trees of Cayley graphs and an associated compactification of semigroups
• Negative association in uniform forests and connected graphs
• Notes on growing a tree in a graph
• Uniform spanning trees on Sierpiński graphs
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• Rooted Uniform Monotone Minimum Spanning Trees
• Pfaffian formulas for spanning tree probabilities
• Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
• Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning trees
• Models of random subtrees of a graph
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Transfer current and pattern fields in spanning trees
• Random two-component spanning forests

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718236)