The 2D‐directed spanning forest is almost surely a tree
From MaRDI portal
Publication:4903277
DOI10.1002/rsa.20400zbMath1257.05159arXiv1206.0088OpenAlexW1982908189MaRDI QIDQ4903277
Publication date: 21 January 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0773
Related Items
Directed, cylindric and radial Brownian webs ⋮ Absence of percolation for Poisson outdegree-one graphs ⋮ A drainage network with dependence and the Brownian web ⋮ Moderate deviations for shortest-path lengths on random segment processes ⋮ The bi-dimensional directed IDLA forest ⋮ Upper large deviations for power-weighted edge lengths in spatial random networks ⋮ The directed spanning forest in the hyperbolic space ⋮ Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web ⋮ Point processes, cost, and the growth of rank in locally compact groups ⋮ Deterministic walk on Poisson point process ⋮ Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation ⋮ The 2D-directed spanning forest converges to the Brownian web ⋮ Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree ⋮ Bigeodesics in first-passage percolation ⋮ Sublinearity of the number of semi-infinite branches for geometric random trees
Cites Work
- Unnamed Item
- Random directed trees and forest -- drainage networks with dependence
- Density and uniqueness in percolation
- Euclidean models of first-passage percolation
- Poisson trees, succession lines and coalescing random walks
- The Brownian web: characterization and convergence
- Random oriented trees: a model of drainage networks.
- Percolation and minimal spanning forests in infinite graphs
- Geodesics in two-dimensional first-passage percolation
- The radial spanning tree of a Poisson point process
- Competition interfaces and second class particles
- Asymptotics of geometrical navigation on a random set of points in the plane
