Metraipolis › archive › dc_e175b2f52348
Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree — arXiv:2608.12295
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12295
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:47:30.947Z
- SHA-256 of the archived text
215c90f7aeded117481875141ca4cc1f332a8cdf823af681c8f6919a3d962d26- Stable URL of this page
https://metraipolis.com/documento/dc_e175b2f52348
How to cite
Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree — arXiv:2608.12295 — arXiv (en), https://arxiv.org/abs/2608.12295 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e175b2f52348 (Metraipolis archive dc_e175b2f52348, sha256 215c90f7aeded117481875141ca4cc1f332a8cdf823af681c8f6919a3d962d26)
BibTeX
@misc{dce175b2f52348,
title = {Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree — arXiv:2608.12295},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12295},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e175b2f52348; sha256 215c90f7aeded117481875141ca4cc1f332a8cdf823af681c8f6919a3d962d26},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12295. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The min-plus process is a stochastic coagulation-annihilation-type process on the binary tree, of interest in mathematics, physics, and computer science as a tractable instance of max-type recursive distributional equations. We carry out large Monte Carlo simulations at effective tree depths up to $N=60$ that provide finite-depth corroboration of the Beta(2,1) stretched-exponential limit for its root value $X_{N}$ at $p=1/2$, on the asymmetric $\sqrt{N}$ side of the random-homogeneous-systems classification recently introduced by Chen, Duquesne, and Shi and by Morfe. Off criticality, our simulations confirm the sub-critical closed form $\mathbb{P}(X_{\infty}=1)=(1-2p)/(1-p)$ within Monte Carlo error and document a super-critical mean growth exceeding the elementary $(2p)^{N}$ lower bound at the depths we reach. For a Bernoulli($q$)-initial-condition variant, we identify an elementary closed-form identity at $p=1/2$ that pins down the order parameter $\mathbb{P}(X_{N}=0)=q$ exactly, locates the absorbing-state phase transition at $p_{c}=1/2$ in the operator-mixing probability rather than in the initial-zero density, and shows that the conditional law on positives deforms substantially with $q$. Our simulations use a level-wise recursion and an FFT-based precomputed leaf table which reduce the effective simulation depth while preserving the recursive tree law and may be useful for the simulation of related recursive equations on large trees.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.PR).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Mathematical Physics (math-ph); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.12295 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:40:02.438Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).