Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.01808 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917811382648832 |
|---|---|
| author | Makowiec, Luca Salvi, Michele Sun, Rongfeng |
| author_facet | Makowiec, Luca Salvi, Michele Sun, Rongfeng |
| contents | For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is of order $n^{1/2+o(1)}$ with high probability, where $n$ is the number of vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_01808 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Diameter of uniform spanning trees on random weighted graphs Makowiec, Luca Salvi, Michele Sun, Rongfeng Probability For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is of order $n^{1/2+o(1)}$ with high probability, where $n$ is the number of vertices. |
| title | Diameter of uniform spanning trees on random weighted graphs |
| topic | Probability |
| url | https://arxiv.org/abs/2311.01808 |