Tree and Grid factors of General Point processes
暂无分享,去创建一个
We study isomorphism invariant point processes of $R^d$ 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 $Z^n$. This perhaps surprising result (that any $d$ and $n$ works) solves a problem by Steve Evans. The construction, based on a connected clumping with $2^i$ vertices in each clump of the $i$'th partition, can be used to define various other factors.
[1] Alexander E. Holroyd,et al. Trees and Matchings from Point Processes , 2002, math/0211455.
[2] Kenneth S. Alexander,et al. Percolation and minimal spanning forests in infinite graphs , 1995 .
[3] Poisson trees, succession lines and coalescing random walks , 2002, math/0209395.
[4] I. Benjamini,et al. Percolation in the hyperbolic plane , 1999, math/9912233.