Hostname: page-component-5db58dd55d-htx7c Total loading time: 0 Render date: 2026-06-02T02:22:43.466Z Has data issue: false hasContentIssue false

The distance on the slightly supercritical random series–parallel graph

Published online by Cambridge University Press:  09 September 2025

Xinxing Chen*
Affiliation:
Shanghai Jiaotong University
Bernard Derrida*
Affiliation:
Collège de France and Ecole Normale Supérieure PSL
Thomas Duquesne*
Affiliation:
Sorbonne Université
Zhan Shi*
Affiliation:
AMSS Chinese Academy of Sciences
*
*Postal address: School of Mathematical Sciences, Shanghai Jiaotong University, 200240 Shanghai, China. Email: chenxinx@sjtu.edu.cn
**Postal address: Collège de France, 11 place Marcelin Berthelot, F-75231 Paris Cedex 05, France. Email: bernard.derrida@phys.ens.fr
***Postal address: LPSM, Sorbonne Université, 4 place Jussieu, F-75252 Paris Cedex 05, France. Email: thomas.duquesne@sorbonne-universite.fr
****Postal address: State Key Laboratory of Mathematical Sciences, AMSS Chinese Academy of Sciences, 100190 Beijing, China. Email: shizhan@amss.ac.cn
Rights & Permissions [Opens in a new window]

Abstract

We consider the random series–parallel graph introduced by Hambly and Jordan (2004 Adv. Appl. Probab. 36, 824–838), which is a hierarchical graph with a parameter $p\in [0, \, 1]$. The graph is built recursively: at each step, every edge in the graph is either replaced with probability p by a series of two edges, or with probability $1-p$ by two parallel edges, and the replacements are independent of each other and of everything up to then. At the nth step of the recursive procedure, the distance between the extremal points on the graph is denoted by $D_n (p)$. It is known that $D_n(p)$ possesses a phase transition at $p=p_c \;:\!=\;\frac{1}{2}$; more precisely, $\frac{1}{n}\log {{\mathbb{E}}}[D_n(p)] \to \alpha(p)$ when $n \to \infty$, with $\alpha(p) >0$ for $p>p_c$ and $\alpha(p)=0$ for $p\le p_c$. We study the exponent $\alpha(p)$ in the slightly supercritical regime $p=p_c+\varepsilon$. Our main result says that as $\varepsilon\to 0^+$, $\alpha(p_c+\varepsilon)$ behaves like $\sqrt{\zeta(2) \, \varepsilon}$, where $\zeta(2) \;:\!=\; \frac{\pi^2}{6}$.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. At each step of the construction of the hierarchical lattice, each edge of the lattice is replaced by two edges in series with probability p or by two edges in parallel with probability $1 - p$. The left shows graph ${\mathtt{Graph}}_0(p)$ and the right shows the two possibilities for the graph ${\mathtt{Graph}}_1(p)$.

Figure 1

Figure 2. An example of the first four graphs in the sequence $({\mathtt{Graph}}_n(p))_{n\geq 0}$.

Figure 2

Figure 3. On the left, solution $F(t,\, x)$ using the parametric form (2.4) at times $t_0$, $3 t_0$, $5 t_0$, and $7t_0$ for $F_0(z)= z \, {\textrm{e}}^{-z}$. The same with the shock on the right.