The 2d-Directed Spanning Forest is almost surely a tree - Archive ouverte HAL Access content directly
Journal Articles Random Structures and Algorithms Year : 2013

The 2d-Directed Spanning Forest is almost surely a tree

(1) , (1, 2)
1
2

Abstract

We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually a tree. Contrary to other directed forests of the literature, no Markovian process can be introduced to study the paths in our DSF. Our proof is based on a comparison argument between surface and perimeter from percolation theory. We then show that this result still holds when the points of N belonging to an auxiliary Boolean model are removed. Using these results, we prove that there is no bi-infinite paths in the DSF.
Fichier principal
Vignette du fichier
DSF9.pdf (587.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00523330 , version 1 (04-10-2010)
hal-00523330 , version 2 (01-02-2011)
hal-00523330 , version 3 (27-06-2011)

Identifiers

Cite

David Coupier, Viet Chi Tran. The 2d-Directed Spanning Forest is almost surely a tree. Random Structures and Algorithms, 2013, 42 (1), pp.59-72. ⟨10.1002/rsa.20400⟩. ⟨hal-00523330v3⟩
154 View
145 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More