Trees and matchings from point processes

Details Trees and matchings from point processes Trees and matchings from point processes

2002-11-29

arxiv.org/abs/math/0211455v1

Mathematics

Probability

Scientific paper

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended tree as a factor graph. This implies that the Poisson points can be given an ordering isomorphic to the usual ordering of the integers in a deterministic isometry-invariant way. For d \geq 4 our result answers a question posed by Ferrari, Landim and Thorisson. We prove also that any isometry-invariant ergodic point process of finite intensity in Euclidean or hyperbolic space has a perfect matching as a factor graph provided all the inter-point distances are distinct.

Affiliated with

Also associated with

No associations

Rating

Trees and matchings from point processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trees and matchings from point processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trees and matchings from point processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-91786