Tree and grid factors for general point processes
From MaRDI portal
Abstract: We study isomorphism invariant point processes of whose groups of symmetries are almost surely trivial. We define a 1-ended, locally finite tree factor on the points of the process, that is, a mapping of the point configuration to a graph on it that is measurable and equivariant with the point process. This answers a question of Holroyd and Peres. The tree will be used to construct a factor isomorphic to . This perhaps surprising result (that any and works) solves a problem by Steve Evans. The construction, based on a connected clumping with vertices in each clump of the 'th partition, can be used to define various other factors.
Recommendations
Cited in
(18)- Perfect matchings as IID factors on non-amenable groups
- Trees and matchings from point processes
- Translation-equivariant matchings of coin flips on \(\mathbb Z^d\)
- Characterization of Palm measures via bijective point-shifts
- Invasion percolation on the Poisson-weighted infinite tree
- Invariant transports of stationary random measures and mass-stationarity
- The Palm-duality for random subsets of d-dimensional grids
- Harmonic deformation of Delaunay triangulations
- Point processes, cost, and the growth of rank in locally compact groups
- Invariant tilings and unimodular decorations of Cayley graphs
- Invariant embeddings of unimodular random planar graphs
- One-ended spanning trees in amenable unimodular graphs
- Optimal stationary markings
- Invariant colorings of random planar maps
- On maximal hard-core thinnings of stationary particle processes
- Factors of IID on trees
- A nonamenable ``factor of a Euclidean space
- Poisson splitting by factors
This page was built for publication: Tree and grid factors for general point processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768219)