Joost Jorritsma
joint with Júlia Komjáthy, Dieter Mitsche
One World Probability Seminar, June '26
[Gandolfi '88, Grimmett & Marstrand '90, Kesten & Zhang '90, Pisztora '96]
Surface-tension driven behavior
The largest component
Geom. Inhom. Random Graph
Long-range percolation
Bond percolation on \(\mathbb{Z}^d\)
Lower tail:
- surface tension
- vertex boundary
Vertex set \(\mathcal{V}_\infty\)
Edge set \(\mathcal{E}_\infty\)
Connection probability
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\phantom{p}\bigg(\frac{\beta}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\phantom{p}\bigg(\frac{\beta}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\phantom{p}\bigg(\frac{\beta}{\|x_u-x_v\|^d}\phantom{\wedge 1}\bigg)^\alpha$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\phantom{p\bigg(}\frac{1}{\|x_u-x_v\|^d}\phantom{\bigg)^\alpha\wedge 1}$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\phantom{p}\bigg(\frac{1}{\|x_u-x_v\|^d}\phantom{\wedge 1}\bigg)^\alpha$$
Vertex set \(\mathcal{V}_\infty\)
Edge set \(\mathcal{E}_\infty\)
Connection probability
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot \phantom{(w_u\cdot w_v)}}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
Vertex set \(\mathcal{V}_\infty\)
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot (w_u\cdot w_v)}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot {\color{darkred}(w_u\cdot w_v)}}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
Edge set \(\mathcal{E}_\infty\)
Connection probability
Vertex set \(\mathcal{V}_\infty\)
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot (w_u\cdot w_v)}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
Geom. inhom. RG
Long-range percolation
Lower tail*:
If \(\mathbb{E}[\# \text{edges of length } n^{1/d}]\to\infty\)
*log-corrections at phase transition
Upper tail:
If non-critical
*at continuity points of \(I(\rho)\)
Biskup ['04]
BFKRZ['23], \(d,p\!=\!1, \alpha\!=\!\infty\)
Geom. inhom. RG
Long-range percolation
Lower tail*:
If \(\mathbb{E}[\# \text{edges of length } n^{1/d}]\to\infty\)
*log-corrections at phase transition
Upper tail:
If non-critical, \(\rho\in(\theta, 1)\)
*at continuity points of \(I(\rho)\)
Truncation
Local convergence
\(m_n\sim n^{2-\alpha}\) boxes
[O'Connell '98; Andreis, König, A. Patterson '21]
\(m_n\sim n^{2-\alpha}\) boxes
Geom. inhom. RG
Long-range percolation
Lower tail*:
If \(\mathbb{E}[\# \text{edges of length } n^{1/d}]\to\infty\)
*log-corrections at phase transition
Upper tail:
If non-critical, \(\rho\in(\theta, 1)\)
*at continuity points of \(I(\rho)\)
Related work:
*at continuity points of \(\lceil h(\rho)\rceil\) and \(\lceil\nu\rceil\)
\(\lceil h(\rho)\rceil\):
# hubs (\(w_v=\Theta(n)\)) required to increase \(|{\color{blue}\mathcal{C}_n^{(1)}}|\) from \(\approx\theta n\) to \(>\rho n\)
Intuition for the probability:
Connection probability
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot (w_u\cdot w_v)}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
\(\lceil h(\rho)\rceil\):
# hubs (\(w_v=\Theta(n)\)) required to increase \(|{\color{blue}\mathcal{C}_n^{(1)}}|\) from \(\approx\theta n\) to \(>\rho n\)
Intuition
Connection probability
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=p\bigg(\frac{\beta\cdot (w_u\cdot w_v)}{\|x_u-x_v\|^d}\wedge 1\bigg)^\alpha$$
Geom. inhom. RG
Long-range percolation
Lower tail*:
If \(\mathbb{E}[\# \text{edges of length } n^{1/d}]\to\infty\)
*log-corrections at phase transition
Upper tail:
If non-critical, \(\rho\in(\theta, 1)\)
*at continuity points of \(I(\rho)\)
Vertex set \(\mathcal{V}_\infty\)
Edge set \(\mathcal{E}_\infty\)
Connection probability
$$\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\bigg(\beta\frac{\kappa(w_u, w_v)}{\|x_u-x_v\|^d}\bigg)^\alpha\wedge 1$$
Vertex set \(\mathcal{V}_\infty\)
Edge set \(\mathcal{E}_\infty\)
Geom. Inhom. RG
Hyperbolic RG
Geom. RG
Long-range perc.
Scale-free Gilbert RG
Age-dependent RCM
Theorem. When \(\tau<2\) or \(\alpha<1\):
[Deijfen, v.d. Hofstad, Hooghiemstra '13], [Gracar, Grauer, Lüchtrath, Mörters '18]
[Heydenreich, Hulshof, J. '17], [Hirsch '17], [v.d. Hofstad, v.d. Hoorn, Maitra '22],
[J., Komjáthy, Mitsche, '23], [Lüchtrath '22]
Theorem. When \(\tau>2\) and \(\alpha>1\):
$$\mathbb{P}(\mathrm{deg}(0)\ge k)\sim k^{-(\tau-1)}.$$
\(\tau\) small: many hubs
\(\alpha\) small: many long edges
Connection probability
$${\color{grey}\mathbb{P}\big(u\leftrightarrow v\mid \mathcal{V}_\infty\big)=\bigg(\beta}\frac{\kappa(w_u, w_v)}{\color{grey}\|x_u-x_v\|^d}{\color{grey}\bigg)^\alpha\wedge 1}$$
A parameterized kernel: \(\sigma\ge 0\)
$$\kappa_{\sigma}(w_u, w_v):=\max\{w_u, w_v\}\min\{w_u, w_v\}^\sigma$$
SFP/GIRG
Hyperbolic RG
Age-dep. RCM
Scale-free Gilbert
Long-range percolation
Random geom. graph
Nearest-neighbor percolation
Remarks.
No known results
Example 1:
Scale-free Gilbert RG in \(d=1\)
Power-law degrees: \(\tau>2\)
\(d\ge 2\)
* [Gracar, Lüchtrath, Mönch '22]
Theorem. (J., Komjáthy, Mitsche '23+)
Set
If \(\zeta_\ast>0\), then LLN for \(|{\color{blue}\text{largest}}|\), and
Long-range parameter: \(\alpha>1\)
\(\kappa_\mathrm{max}=w_u\vee w_v\)
\(\kappa_\mathrm{prod}=w_uw_v\)
Example 2:
Geom. Inhomog. RG in \(d=1\)
Aim: Find minimal \(\zeta\) s.t.
Aim: Find \(\gamma\) s.t.
Aim: Find minimal \(\zeta\) s.t.
Aim: Find \(\gamma\) s.t.
(FKG)
\(\delta\) small
# possibilities for \(|{\color{red}2^{\mathrm{nd}}\text{-largest}}|\ge k\)
Questions
Questions
[Alexander & Chayes & Chayes '90], [Grimmett & Marstrand, '90], [Kesten & Zhang '90], ..., [Deuschel, Pisztora, '96], [Biskup '04], [Penrose '05], [Sly & Crawford'12], [Kiwi & Mitsche '17], [Lichev, Lodewijks, Mitsche, Schapira '22], [Bläsius, Friedrich, Ruff, Zeiff, '23]
Description of weight distribution in large components
Prevent "small-to-large" merging
Answered questions (\(d=1\))
Open problems:
Answered questions (\(d=1\))
Small
Large
Remarks.
Power-law degrees: \(\tau>2\)
\(d\ge 2\)
* [Gracar, Lüchtrath, Mönch '22]
Theorem. (J., Komjáthy, Mitsche '23+)
Set
If \(\zeta_\ast>0\), then LLN for \(|{\color{blue}\text{largest}}|\), and
Long-range parameter: \(\alpha>1\)
Example 2:
Geom. Inhomog. RG in \(d=1\)
Hyperbolic random graph
Scale-free percolation
Long-range percolation
Scale-free Gilbert RG
Random geom. graph
Nearest-neighbor percolation