Timár, Ádám (2021) A Nonamenable "Factor" of a Euclidean Space. ANNALS OF PROBABILITY, 49 (3). pp. 1427-1449. ISSN 0091-1798
|
Text
2424.pdf Download (515kB) | Preview |
Abstract
Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space R-d, d >= 3, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is the 3-regular infinite tree. Along the way, it is proved that any finitely generated one-ended amenable Cayley graph can be represented in R-d as an isometry-invariant random partition of R-d to bounded polyhedra, and also as an isometry-invariant random partition of R-d to indistinguishable pieces. A new technique is developed to prove indistinguishability for certain constructions, connecting this notion to factor of IID's.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Indistinguishability; Factor of IID; Random tiling; isometry-invariant tiling; |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 04 Jan 2022 15:48 |
Last Modified: | 26 Apr 2023 11:03 |
URI: | http://real.mtak.hu/id/eprint/135349 |
Actions (login required)
Edit Item |