Trees and Matchings from Point Processes

By Alexander E. Holroyd, Yuval Peres. 2002

64 citations recorded by the source corpus.

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 greater than or equal to 4 our result answers a question posed by Ferrari, Landim and Thorisson [7]. 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.

Subfields: Applied Mathematics, Computer Graphics and Computer-Aided Design, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/f9ea295c08ecfaa285c13bb1f9c161e0489f8163

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Günter Last
  2. Yuval Peres
  3. Hermann Thorisson
  4. Robin Pemantle
  5. Oded Schramm
  6. Alexander E. Holroyd
  7. Russell Lyons
  8. Sourav Chatterjee

In Computer Graphics and Computer-Aided Design

  1. Russell Lyons
  2. David J. Aldous
  3. Robin Pemantle
  4. Oded Schramm
  5. Yuval Peres
  6. Alexander E. Holroyd
  7. Charles Bordenave
  8. Pietro Caputo

In Mathematical Physics

  1. Russell Lyons
  2. Yuval Peres
  3. Günter Last
  4. Robin Pemantle
  5. Oded Schramm
  6. Hermann Thorisson
  7. Alexander E. Holroyd
  8. Dan Romik

Citations in the corpus