Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.08149

Infinite-mean Galton-Watson trees have zero random-interchange threshold

Andreas Klippel·Benjamin Lees·Christian Mönch
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that, on a Galton-Watson tree with almost surely finite offspring and infinite offspring mean, the random interchange process has critical parameter zero for infinite cycles, conditionally on survival. Combined with the finite-mean strict inequality established in \emph{arXiv:2503.03319}, this gives a dichotomy for locally finite Galton-Watson trees with offspring mean in $(1,\infty]$: the loop and link critical parameters coincide exactly in the infinite-mean case. The proof reduces the tree problem to a finite permutation estimate derived from peeling estimates for random surfaces.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Klippel, Benjamin Lees, Christian Mönch. 2026-10-06. Infinite-mean Galton-Watson trees have zero random-interchange threshold. https://arxiv.org/abs/2610.08149

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A generalized coupling approach for the weak approximation of stochastic functional differential equations

In this paper, we study functional type weak approximation of weak solutions of stochastic functional differential equations by means of the Euler--Maruyama scheme. Under mild assumptions on the coefficients, we provide a quantitative error estimate for the weak approximation in terms of the Lévy--Prokhorov metric of probability laws on the path space. The weak error estimate obtained in this paper is sharp in the topological and quantitative senses in some special cases. We apply our main result to ten concrete examples appearing in a wide range of science and obtain a weak error estimate for each model. The proof of the main result is based on the so-called generalized coupling of probability measures.

math.PR↗
arXiv2026

Quantitative Brownian Symmetrization: Stability and a Sharp Energy Threshold

This paper continues our earlier work \cite{becher2025skorokhod} on variational questions arising from the planar Skorokhod embedding problem (PSEP). Given a centered probability measure $μ$ on $\mathbb R$ with finite second moment, PSEP asks for a simply connected domain $U\subset\mathbb C$ containing $0$ such that planar Brownian motion $(Z_t)$ started at $0$ exits $U$ at time $τ_U$ with real part $\Re(Z_{τ_U})\simμ$. Among all such $μ$-domains, we study optimal design problems and focus in particular on area minimization and its fractional boundary-energy extensions. We formalize and define the Brownian symmetrization of planar domains, and we clarify the relation between Brownian (Gross) symmetrization and the Baernstein-Pruss symmetrization theory, and how Brownian symmetrization applies to a wider category of domains. Within the simply connected class, Gross' $μ$-domain $U_μ^G$ minimizes a whole fractional scale of boundary energies $\mathcal E_s$, $0<s<1$. The proof is formulated in a nonlocal Hardy--Sobolev language: it relies only on the exit law $μ$ and on fractional Sobolev (Gagliardo) seminorms, rather than on an explicit uniformizer or star-function techniques. We introduce deficiency ratios $ρ_s$ that quantify how far a given $μ$-domain is from the Gross optimizer; we state several related open problems.

math.PR↗
arXiv2026

Spectral Duality and Reset-Neutral Distributions in Random Walks with Multi-Site Geometric Resetting

We study the gambler's ruin problem for a biased random walk on $\{0,1,\dots,a\}$ under multi-site geometric resetting: at each step the walker is reset with probability $γ\in(0,1)$ to a position drawn from a distribution $π$ over $m$ interior sites. Using renewal theory, we derive a closed-form expression for the ruin probability, showing that the whole effect of $π$ is encoded in a single scalar, the coupling constant $C(π,γ)$. A spectral analysis via the Doob symmetrization reveals its structure. Our central result is a general criterion, valid for any absorbed Markov chain with a spectral decomposition, for the existence of a reset-neutral distribution $π^*$ with $C(π^*,γ)$ independent of $γ$. The criterion is a spectral duality condition: an involution $σ$ on the reset sites and mode-independent weights $κ$ with $B_ν(z)=κ(z)A_ν(σ(z))$ for all modes $ν$, and a common pair product $κ(z)κ(σ(z))=K$. The invariant value is then $C^*=1/(1+\sqrt{K})$. For the biased random walk the condition is equivalent to the geometric symmetry $z_i+z_i'=a$, and $C^*$ is the classical ruin probability from the midpoint, for any domain size, number of reset sites, bias and resetting rate. Since the duality holds step by step in time, the critical distributions are reset-neutral for every resetting mechanism independent of the walk under which absorption is almost sure. Algebraic and Monte Carlo verifications confirm the theory to machine and statistical precision, and numerical illustrations reveal a phase-like structure in the space of reset distributions, with $π^*$ acting as a separatrix between monotone regimes.

math.PR↗