Arithmetic oscillations of the chemical distance in long-range percolation on $\mathbb Z^d$
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_ | 1866916300325912576 |
|---|---|
| author | Biskup, Marek Krieger, Andrew |
| author_facet | Biskup, Marek Krieger, Andrew |
| contents | We consider a long-range percolation graph on $\mathbb Z^d$ where, in addition to the nearest-neighbor edges of $\mathbb Z^d$, distinct $x,y\in\mathbb Z^d$ are connected by an edge independently with probability asymptotic to $β|x-y|^{-s}$, for $s\in(d,2d)$, $β>0$ and $|\cdot|$ a norm on $\mathbb R^d$. We first show that, for all but a countably many $β>0$, the graph-theoretical (a.k.a. chemical) distance between typical vertices at $|\cdot|$-distance $r$ is, with high probability as $r\to\infty$, asymptotic to $ϕ_β(r)(\log r)^Δ$, where $Δ^{-1}:=\log_2(2d/s)$ and $ϕ_β$ is a positive, bounded and continuous function subject to $ϕ_β(r^γ)=ϕ_β(r)$ for $γ:=s/(2d)$. The proof parallels that in a continuum version of the model where a similar scaling was shown earlier by the first author and J. Lin. This work also conjectured that $ϕ_β$ is constant which we show to be false by proving that $(\logβ)^Δϕ_β$ tends, as $β\to\infty$, to a non-constant limit which is independent of the specifics of the model. The proof reveals arithmetic rigidity of the shortest paths that maintain a hierarchical (dyadic) structure all the way to unit scales. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_12365 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Arithmetic oscillations of the chemical distance in long-range percolation on $\mathbb Z^d$ Biskup, Marek Krieger, Andrew Probability Combinatorics 60K35, 82B43, 05C12, 05C82 We consider a long-range percolation graph on $\mathbb Z^d$ where, in addition to the nearest-neighbor edges of $\mathbb Z^d$, distinct $x,y\in\mathbb Z^d$ are connected by an edge independently with probability asymptotic to $β|x-y|^{-s}$, for $s\in(d,2d)$, $β>0$ and $|\cdot|$ a norm on $\mathbb R^d$. We first show that, for all but a countably many $β>0$, the graph-theoretical (a.k.a. chemical) distance between typical vertices at $|\cdot|$-distance $r$ is, with high probability as $r\to\infty$, asymptotic to $ϕ_β(r)(\log r)^Δ$, where $Δ^{-1}:=\log_2(2d/s)$ and $ϕ_β$ is a positive, bounded and continuous function subject to $ϕ_β(r^γ)=ϕ_β(r)$ for $γ:=s/(2d)$. The proof parallels that in a continuum version of the model where a similar scaling was shown earlier by the first author and J. Lin. This work also conjectured that $ϕ_β$ is constant which we show to be false by proving that $(\logβ)^Δϕ_β$ tends, as $β\to\infty$, to a non-constant limit which is independent of the specifics of the model. The proof reveals arithmetic rigidity of the shortest paths that maintain a hierarchical (dyadic) structure all the way to unit scales. |
| title | Arithmetic oscillations of the chemical distance in long-range percolation on $\mathbb Z^d$ |
| topic | Probability Combinatorics 60K35, 82B43, 05C12, 05C82 |
| url | https://arxiv.org/abs/2112.12365 |