A full characterization of invariant embeddability of unimodular planar graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918400531365888 |
|---|---|
| author | Timár, Ádám Tóth, László Márton |
| author_facet | Timár, Ádám Tóth, László Márton |
| contents | When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in \cite{benjamini2019invariant}, using the fact that such graphs automatically have locally finite (simply connected) drawings into the plane. For the case of graphs with multiple ends the question was left open. We revisit Halin's graph theoretic characterization of graphs that have a locally finite embedding into the plane. Then we prove that such unimodular random graphs do have a locally finite invariant embedding into the Euclidean or the hyperbolic plane, depending on whether the graph is amenable or not. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_12709 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | A full characterization of invariant embeddability of unimodular planar graphs Timár, Ádám Tóth, László Márton Probability 60D05, 60K99, 05C10 When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in \cite{benjamini2019invariant}, using the fact that such graphs automatically have locally finite (simply connected) drawings into the plane. For the case of graphs with multiple ends the question was left open. We revisit Halin's graph theoretic characterization of graphs that have a locally finite embedding into the plane. Then we prove that such unimodular random graphs do have a locally finite invariant embedding into the Euclidean or the hyperbolic plane, depending on whether the graph is amenable or not. |
| title | A full characterization of invariant embeddability of unimodular planar graphs |
| topic | Probability 60D05, 60K99, 05C10 |
| url | https://arxiv.org/abs/2101.12709 |