Pith. sign in

REVIEW 3 minor 34 references

In the critical case a coupling with the truncated Kesten tree directly yields local distributional convergence of conditioned Lévy trees to the Kesten tree.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-07-03 07:10 UTC pith:E3AZG7AN

load-bearing objection The paper gives a direct coupling of critical conditioned Lévy trees to a truncated Kesten tree that covers three size-based conditionings at once and yields the local limit.

arxiv 2607.01877 v1 pith:E3AZG7AN submitted 2026-07-02 math.PR

Coupling some conditioned L{\'e}vy trees with the Kesten tree

Romain Abraham (IDP) , Jean-Fran\c{c}ois Delmas (CERMICS UMR 9032) This is my paper
classification math.PR
keywords Lévy treesKesten treeconditioned to be largelocal convergencecritical regimecouplingbranching trees
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs an explicit coupling between a locally compact Lévy tree conditioned to be large and a truncated version of the Kesten tree. The coupling is built for three different notions of size: height, maximal vertex mass, and total mass. When the underlying Lévy process is critical, the coupling immediately implies that the conditioned tree converges locally in distribution to the Kesten tree. The same construction is attempted in the sub-critical and super-critical regimes, but condensation can obstruct the argument in the sub-critical case.

Core claim

When the driving Lévy process is critical, the conditioned Lévy tree (to be large by height, by maximal vertex size, or by total mass) can be coupled with a truncated Kesten tree in such a way that the local convergence in distribution of the conditioned tree to the Kesten tree follows at once from the coupling.

What carries the argument

The coupling of the conditioned Lévy tree with a truncated Kesten tree, which transfers the local limit directly.

Load-bearing premise

The conditioned Lévy tree remains locally compact, so that condensation does not break the coupling construction.

What would settle it

A simulation or explicit construction in which the local neighborhood of the root in a height-conditioned critical Lévy tree has a different law from the corresponding neighborhood in the Kesten tree.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Local convergence holds simultaneously under all three size criteria in the critical regime.
  • The same coupling argument applies without modification to the super-critical regime.
  • In the sub-critical regime the results remain valid only when condensation is absent.
  • The local limit object is always the Kesten tree, independent of which size criterion is used for conditioning.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The truncation step in the Kesten tree supplies a concrete finite approximation that could be used to simulate the infinite limit.
  • Similar couplings might be feasible for other classes of conditioned branching structures that admit a Kesten-type limit.
  • The three conditioning criteria produce the same local limit, suggesting that the choice of size functional becomes irrelevant once the local neighborhood is fixed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript considers locally compact Lévy trees conditioned to be large under three criteria (height, maximal-size vertex, total mass). In the critical case it constructs an explicit coupling to a truncated Kesten tree and uses the coupling to prove local convergence in distribution to the untruncated Kesten tree; partial results are stated for the sub-critical and super-critical regimes, with the sub-critical case limited by a condensation phenomenon placed outside the framework.

Significance. If the coupling is rigorously constructed, the work supplies a direct probabilistic argument for the local limit of conditioned Lévy trees under three natural size conditionings. Such an explicit coupling is a useful addition to the literature on Lévy trees and conditioned branching processes, as it avoids indirect arguments via generating functions or excursion theory and may facilitate further quantitative estimates.

minor comments (3)
  1. The abstract states that a coupling is constructed but supplies no indication of the truncation rule or the control on the event that truncation affects a fixed-radius ball; a one-sentence outline of this control would improve readability.
  2. Notation for the three conditioning criteria (height, maximal-size vertex, total mass) is introduced only informally; explicit definitions and a uniform notation should appear in the first section that states the main results.
  3. The manuscript should clarify whether the Lévy process is assumed to have no negative jumps or whether the argument extends to the general spectrally negative case; this affects the local-compactness claim used throughout.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, the assessment of significance, and the recommendation of minor revision. No major comments are listed in the report.

Circularity Check

0 steps flagged

No circularity: direct coupling construction is self-contained

full rationale

The paper constructs an explicit coupling in the critical regime between conditioned Lévy trees (under height, maximal size, or mass criteria) and a truncated Kesten tree, then uses it to obtain local convergence in distribution. This is a direct probabilistic argument rather than any reduction of a claimed prediction or uniqueness result to fitted parameters, self-definitions, or prior self-citations. The abstract explicitly excludes the sub-critical condensation case as outside the framework, confirming the critical-case derivation does not rely on circular inputs. No load-bearing step equates an output to its own construction by definition.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on standard properties of Lévy processes and locally compact trees; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • domain assumption Lévy trees are locally compact under the chosen conditioning measures
    Invoked when restricting the analysis to the critical case and the three size criteria.
  • standard math Standard convergence theory for branching processes applies once the coupling is established
    Used to transfer the local convergence statement from the truncated Kesten tree.

pith-pipeline@v0.9.1-grok · 5637 in / 1302 out tokens · 20171 ms · 2026-07-03T07:10:45.335737+00:00 · methodology

0 comments
read the original abstract

We consider locally compact L{\'e}vy trees conditioned to be large, with respect to different criterion: its height, its maximal ''size'' vertex and its total ''mass''. In the critical case, we provide a coupling with a truncated Kesten tree which then allows to directly prove the local convergence in distribution of the conditioned L{\'e}vy tree to be large towards the Kesten tree. We also consider the sub-critical and super-critical cases. In the former case the results can be partial, due to a possible condensation phenomenon which is outside the mathematical framework used in this paper.

Figures

Figures reproduced from arXiv: 2607.01877 by Jean-Fran\c{c}ois Delmas (CERMICS UMR 9032), Romain Abraham (IDP).

Figure 1
Figure 1. Figure 1: Left: the Kesten tree (a spine given by an semi-infinite branch on which are grafted L´evy sub-trees); Right: the truncated Kesten tree K height h with the distinguished vertex h on the spine being the only vertex at distance h from the root ϱ. We summarize Theorem 3.1 on the coupling, and the local convergence of the truncated Kesten trees from Proposition 3.3 and the direct consequence of the local conve… view at source ↗
Figure 2
Figure 2. Figure 2: Left: the Kesten tree with vertices of “size” ≥ δ; Center: the truncated Kesten tree K node,∗ δ with the distinguished vertex Hδ on the spine; Right: the tree Knode δ , with an independent sub-tree grafted at Hδ whose root is of “size” = δ and which does not have any vertex of “size” ≥ δ. maximal vertex “size” is +∞ as the support of the L´evy measure π is unbounded, and thus conditioning on the maximal ve… view at source ↗
Figure 3
Figure 3. Figure 3: Left: the Kesten tree; Center: the sub-trees grafted on the spine, with in gray an instance of a tree Ti (with the root being a branching point) grafted at height hi with mass σi ; Right: mass of the grafted trees. From the process S r , we build a modified truncated Kesten tree, say Kmass r , by considering a spine of length ζr on which we graft at height hj an independent L´evy tree Tj with total mass σj… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages

  1. [1]

    Abraham, A

    R. Abraham, A. Bouaziz, and J.-F. c. Delmas. Very fat geometric Galton-Watson trees. ESAIM Probab. Stat., 24:294– 314, 2020

    work page 2020

  2. [2]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. Williams’ decomposition of the L´ evy continuum random tree and simultaneous extinction probability for populations with neutral mutations.Stochastic Processes and their Applications, 119(4):1124–1143, 2009

    work page 2009

  3. [3]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. A continuum-tree-valued Markov process. The Annals of Probability , 40(3):1167–1211, May 2012

    work page 2012

  4. [4]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. Record process on the Continuum Random Tree. ALEA - Latin American Journal of Probability and Mathematical Statistics , 10:225–251, 2013

    work page 2013

  5. [5]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. Local limits of conditioned Galton-Watson trees: The condensation case. Electronic Journal of Probability, 19:6–8, June 2014

    work page 2014

  6. [6]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. Local limits of conditioned Galton-Watson trees: The infinite spine case. Electronic Journal of Probability, 19, Jan. 2014

    work page 2014

  7. [7]

    Abraham and J.-F

    R. Abraham and J.-F. Delmas. An introduction to Bienaym´ e-Galton-Watson trees and their local limits. To appear, pages 1–51, 2026

    work page 2026

  8. [8]

    Abraham, J.-F

    R. Abraham, J.-F. Delmas, and H. He. Brownian continuum random tree conditioned to be large. Electronic Journal of Probability, 31(96):1–70, 2026

    work page 2026

  9. [9]

    Abraham, J.-F

    R. Abraham, J.-F. Delmas, and P. Hoscheit. A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces. Electronic Journal of Probability, 18:1–21, 2013

    work page 2013

  10. [10]

    Abraham, J.-F

    R. Abraham, J.-F. Delmas, and P. Hoscheit. Exit times for an increasing L´ evy tree-valued process. Probability Theory and Related Fields, 159(1-2):357–403, June 2014

    work page 2014

  11. [11]

    Abraham, J.-F

    R. Abraham, J.-F. Delmas, and M. Nassif. Conditioning (sub)critical l´ evy trees by their maximal degree: decomposition and local limit, 2022

    work page 2022

  12. [12]

    D. Aldous. The continuum random tree II: An overview. In M. Barlow and N. Bingham, editors, Stochastic Analysis, pages 23–70. Cambridge University Press, 1991

    work page 1991

  13. [13]

    Aldous and J

    D. Aldous and J. Pitman. Tree-valued Markov chains derived from Galton-Watson processes.Annales de l’Institut Henri Poincar´ e (B) Probability and Statistics, 34(5):637–686, 1998

    work page 1998

  14. [14]

    J. Bertoin. L´ evy processes, volume 121 of Cambridge Tracts in Mathematics . Cambridge University Press, Cambridge, 1996

    work page 1996

  15. [15]

    Chaumont and G

    L. Chaumont and G. Uribe Bravo. Markovian bridges: weak continuity and pathwise constructions. Ann. Probab., 39(2):609–647, 2011

    work page 2011

  16. [16]

    Curien and J.-F

    N. Curien and J.-F. c. Le Gall. The Brownian plane. J. Theoret. Probab., 27(4):1249–1291, 2014

    work page 2014

  17. [17]

    Duquesne

    T. Duquesne. A limit theorem for the contour process of condidtioned Galton–Watson trees. The Annals of Probability, 31(2):996–1027, 2003

    work page 2003

  18. [18]

    Duquesne

    T. Duquesne. Continuum random trees and branching processes with immigration. Stochastic Processes and their Applications, 119(1):99–129, 2009

    work page 2009

  19. [19]

    Duquesne and J.-F

    T. Duquesne and J.-F. Le Gall. Random Trees, L´ evy Processes and Spatial Branching Processes, volume 281. SMF, 2002

    work page 2002

  20. [20]

    Duquesne and J.-F

    T. Duquesne and J.-F. Le Gall. Probabilistic and fractal aspects of L´ evy trees. Probability Theory and Related Fields , 131(4):553–603, Apr. 2005

    work page 2005

  21. [21]

    Duquesne and M

    T. Duquesne and M. Winkel. Mass erasure of L´ evy trees. In preparation. In preparation

    work page

  22. [22]

    S. N. Evans. Probability and Real Trees, volume 1920. Springer, 2008

    work page 1920

  23. [23]

    S. Janson. Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation. Probability Surveys, 9:103–252, 2012

    work page 2012

  24. [24]

    S. Janson. Real trees, 2023

    work page 2023

  25. [25]

    Jonsson and S

    T. Jonsson and S. ¨O. Stef´ ansson. Condensation in nongeneric trees.Journal of Statistical Physics , 142:277–313, 2011

    work page 2011

  26. [26]

    Kallenberg

    O. Kallenberg. Random measures, theory and applications , volume 77 of Probability Theory and Stochastic Modelling . Springer, Cham, 2017

    work page 2017

  27. [27]

    H. Kesten. Subdiffusive behavior of random walk on a random cluster. Ann. Inst. H. Poincar´ e Probab. Statist. , 22(4):425–487, 1986

    work page 1986

  28. [28]

    Kortchemski

    I. Kortchemski. Limit theorems for conditioned non-generic Galton–Watson trees. Annales de l’Institut Henri Poincar´ e (B) Probability and Statistics , 51(2):489–511, May 2015

    work page 2015

  29. [29]

    A. E. Kyprianou, V. Rivero, and B. ¸Seng¨ ul. Conditioning subordinators embedded in Markov processes. Stochastic Process. Appl., 127(4):1234–1254, 2017

    work page 2017

  30. [30]

    A. Lambert. Quasi-Stationary Distributions and the Continuous-State Branching Process Conditioned to Be Never Extinct. Electronic Journal of Probability, 12, Apr. 2007

    work page 2007

  31. [31]

    J.-F. Le Gall. Random trees and applications. Probability Surveys, 2:245–311, 2005

    work page 2005

  32. [32]

    Le Gall and Y

    J.-F. Le Gall and Y. Le Jan. Branching processes in L´ evy processes: The exploration process.The Annals of Probability, 26(1):213–252, 1998

    work page 1998

  33. [33]

    R. L. Schilling, R. Song, and Z. Vondraˇ cek. Bernstein functions , volume 37 of De Gruyter Studies in Mathematics . Walter de Gruyter & Co., Berlin, second edition, 2012. Theory and applications. COUPLING SOME CONDITIONED L ´EVY TREES WITH THE KESTEN TREE 29

    work page 2012

  34. [34]

    H. G. Tucker. The supports of infinitely divisible distribution functions. Proc. Amer. Math. Soc. , 49:436–440, 1975. ✂ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

    work page 1975