Percolation threshold for metric graph loop soup
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913183620399104 |
|---|---|
| author | Chang, Yinshan Du, Hang Li, Xinyi |
| author_facet | Chang, Yinshan Du, Hang Li, Xinyi |
| contents | In this short note, we show that the critical threshold for the percolation of metric graph loop soup on a large class of transient metric graphs (including quasi-transitive graphs such as $\mathbb{Z}^d$, $d\geq 3$) is $1/2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_08225 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Percolation threshold for metric graph loop soup Chang, Yinshan Du, Hang Li, Xinyi Probability 60K35, 82B43 In this short note, we show that the critical threshold for the percolation of metric graph loop soup on a large class of transient metric graphs (including quasi-transitive graphs such as $\mathbb{Z}^d$, $d\geq 3$) is $1/2$. |
| title | Percolation threshold for metric graph loop soup |
| topic | Probability 60K35, 82B43 |
| url | https://arxiv.org/abs/2304.08225 |