Cluster volumes for the Gaussian free field on metric graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913603274145792 |
|---|---|
| author | Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François |
| author_facet | Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François |
| contents | We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of side length $r$ has volume of order $r^{\frac{d+2}{2}}$, as conjectured by Werner in arXiv:2002.11487. This is in contrast to the mean-field regime $d>6$, where this volume is of order $r^4$. We further obtain precise asymptotic tails for the volume of the critical cluster of the origin, and a lower bound on the tail of the volume of the near-critical cluster of the origin below the upper-critical dimension. Our proof extends to any graph with polynomial volume growth and polynomial decay of the Green's function as long as the critical one-arm probability decays as the square root of the Green's function, which is satisfied in low enough dimension. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06772 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cluster volumes for the Gaussian free field on metric graphs Drewitz, Alexander Prévost, Alexis Rodriguez, Pierre-François Probability Mathematical Physics 60K35, 60G15, 60J45, 82B43 We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of side length $r$ has volume of order $r^{\frac{d+2}{2}}$, as conjectured by Werner in arXiv:2002.11487. This is in contrast to the mean-field regime $d>6$, where this volume is of order $r^4$. We further obtain precise asymptotic tails for the volume of the critical cluster of the origin, and a lower bound on the tail of the volume of the near-critical cluster of the origin below the upper-critical dimension. Our proof extends to any graph with polynomial volume growth and polynomial decay of the Green's function as long as the critical one-arm probability decays as the square root of the Green's function, which is satisfied in low enough dimension. |
| title | Cluster volumes for the Gaussian free field on metric graphs |
| topic | Probability Mathematical Physics 60K35, 60G15, 60J45, 82B43 |
| url | https://arxiv.org/abs/2412.06772 |