Geometry of Gaussian free field sign clusters and random interlacements
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917012255539200 |
|---|---|
| author | Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François |
| author_facet | Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François |
| contents | For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign), and finite sign clusters are necessarily tiny, with overwhelming probability. Examples of graphs belonging to this class include regular lattices like $\mathbb{Z}^d$, for $d \geqslant 3$, but also more intricate geometries, such as Cayley graphs of suitably growing (finitely generated) non-Abelian groups, and cases in which random walks exhibit anomalous diffusive behavior, for instance various fractal graphs. As a consequence, we also show that the vacant set of random interlacements on these objects, introduced by Sznitman in arXiv:0704.2560, and which is intimately linked to the free field, contains an infinite connected component at small intensities. In particular, this result settles an open problem from arXiv:1010.1490. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1811_05970 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Geometry of Gaussian free field sign clusters and random interlacements Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François Probability Mathematical Physics 60K35, 60G15, 60G60, 82B43 For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign), and finite sign clusters are necessarily tiny, with overwhelming probability. Examples of graphs belonging to this class include regular lattices like $\mathbb{Z}^d$, for $d \geqslant 3$, but also more intricate geometries, such as Cayley graphs of suitably growing (finitely generated) non-Abelian groups, and cases in which random walks exhibit anomalous diffusive behavior, for instance various fractal graphs. As a consequence, we also show that the vacant set of random interlacements on these objects, introduced by Sznitman in arXiv:0704.2560, and which is intimately linked to the free field, contains an infinite connected component at small intensities. In particular, this result settles an open problem from arXiv:1010.1490. |
| title | Geometry of Gaussian free field sign clusters and random interlacements |
| topic | Probability Mathematical Physics 60K35, 60G15, 60G60, 82B43 |
| url | https://arxiv.org/abs/1811.05970 |