REVIEW 3 major objections 3 minor 1 cited by
Excursion theory for Markov processes indexed by Levy trees
T0 review · 3 major / 3 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read For a Markov motion on a random Lévy tree, the pieces of path between visits to a point x form a Poisson cloud when marked by a local time.
desk verdict A serious but non-self-contained extension of excursion theory to tree-indexed Markov processes; the main results look right, but referees must verify the reliance on a companion paper. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the Lévy snake $(\rho,W,\Lambda)$: a path-valued Markov process whose lifetime process is the height process $H(\rho)$ of the underlying Lévy tree, so that the tip $W_t(H_t)$ labels the point currently visited by the clockwise exploration. The local time at x, $A$, is defined by (7.1) as the amount of exploration time the labels spend at x, and it is this additive functional that indexes the excursions. The measures $N_{x,r}$ are built by driving the snake with the excursion measure of the underlying Lévy process while the spatial motion follows the exit-system laws of the classical theory; $N^*_x$ is the pruning of $N_{x,0}$ at the first return to x. All arguments are carried out in this $\mathbb{R}_+$-indexed snake picture, which lets the paper use Poisson calculus, spinal decompositions, and the special Markov property before translating back to the tree.
What would settle it
Take the Brownian-tree case with linear Brownian spatial motion and x = 0, where the excursion measure is explicit: compute the Laplace functional $\mathbb{E}[\exp(-\int f\,d\mathcal{E})]$ for a simple test function f supported on one mark set and one time interval. Theorem 7.5 forces the value $\exp(-\int(1-e^{-f})\,dt\otimes N^*_x)$; any analytic or simulated deviation from this exponential form would refute the central claim.
Extended reading notes
Core claim
The central claim is Theorem 7.5: under the law $P_{0,x,0}$ that starts the Lévy snake at the root with label x and local time 0, the point measure $\mathcal{E} = \sum_{u\in D} \delta_{(A_{g(u)},\rho^{u,*},W^{u,*})}$ is a Poisson point measure on $\mathbb{R}_+ \times D(\mathbb{R}_+, M_f(\mathbb{R}_+) \times W_E)$ with intensity $dt \otimes N^*_x$. The excursion measure $N^*_x$ is obtained by truncating the paths of the snake at their first return to x under $N_{x,0}$, and the same setup produces the family $N_{x,r}$ together with the exit formula (7.9), which describes the subtrajectories stemming from the debut points. The paper's second main claim, Theorem 9.1, is that the tree coded by the local time — the tree obtained by identifying each excursion component to a single point — is a $\tilde{\psi}$-Lévy tree; its branching points are exactly the excursions with positive boundary size, and the fractal mass of each such point equals that boundary size. In the Brownian-tree case these objects are shown to coincide with the excursion measure and boundary measure of the earlier theory for Brownian motion indexed by the Brownian tree.
Load-bearing premise
The load-bearing premise is the companion construction of the local time at x for the Lévy snake, together with the assumption that the label process never hits x at a branching point; if either fails, the excursion components cannot be cleanly defined or indexed.
Editorial extensions
If this is right
- Excursions away from x, marked by the local time A at their debut, are conditionally independent under $P_{0,x,0}$, with common law $N^*_x$.
- The exit formula (7.9) turns calculations about subtrajectories at debuts into integrals against the simpler measures $N_{x,r}$, so the excursion measure inherits the Lévy-tree machinery.
- The tree coded by the local time is a $\tilde{\psi}$-Lévy tree; excursions with positive boundary size correspond exactly to its branching points, and the boundary size $\ell_u$ is the fractal mass of the point.
- Conditionally on that tree, the positive-boundary excursions are independent with laws $N^{*,\ell}_x$, while the zero-boundary excursions are independent of the tree and of the positive-boundary family.
- In the Brownian-tree special case the theory reproduces the earlier Brownian excursion measure and boundary measure, and the master formula of that theory appears as a particular case of the exit formula.
Reading between the lines
- A natural extension, not developed in the paper, is to use this Poisson structure to prove spatial Markov properties for random surfaces coded by Lévy trees: conditioning on the tree of local time should leave the excursion disks independent with laws given by the boundary-size-conditioned measures.
- Because $N^*_x$ is defined by pruning $N_{x,0}$, invariance principles for Lévy snakes should transfer automatically to the excursion measure, giving convergence of discrete approximations to the excursion process without a separate construction of the limit.
- The assumption that the label process never hits x at a branching point is load-bearing for unique debuts; models where x is visited at branch points would need a decorated local time and would likely produce a different Poisson intensity.
- One direct test of the boundary-size interpretation is to measure excursion boundary sizes in the stable-tree case and compare their law with the Lévy measure $\tilde{\pi}$ of the $\tilde{\psi}$-tree; Proposition 8.9 predicts an exact match.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper develops an excursion theory for Markov processes indexed by Lévy trees, away from a regular and instantaneous point x of the state space. The main results are the construction of excursion measures N_{x,r} and N*_x, an exit formula (Theorem 7.3), a Poissonian description of the excursion process (Theorem 7.5), and a theorem showing that the genealogy of excursions is encoded in a Lévy tree whose branching masses are the boundary sizes of the excursions (Theorem 9.1). The paper also provides a consistency check with the Abraham–Le Gall excursion theory for Brownian motion indexed by the Brownian tree (Section 10).
Significance. If correct, this is a substantial and original contribution, extending classical excursion theory and Maisonneuve's exit formula to the tree-indexed setting. The Poisson excursion theorem (Theorem 7.5) and the identification of the tree coded by the local time (Theorem 9.1) are natural and potentially powerful tools for Brownian geometry and related models. The paper is openly built on the companion paper [37], but it provides an independent consistency check in Section 10 by recovering the Abraham–Le Gall master formula, which gives real external support. The statements are precise and the overall architecture is coherent.
major comments (3)
- [Section 7.3, Theorem 7.5] The proof of property (iii'), stationary and independent increments, is the load-bearing step for the Poisson claim, and it rests on two unproved assertions. The identity (7.29), which transfers the A-indexing of excursions after time A^{-1}_r to the cumulative exit local time L, is stated with only 'a direct comparison' as justification. In addition, the recovery of the restricted excursion measure 1_{(0,r]}E from the pair (7.24) is left to the reader. Since Theorem 7.5 is the central theorem of the paper, these steps should be written out in full or be derived explicitly from the imported statements in [37].
- [Section 5, Proposition 5.4] The strong Markov property under the infinite measure N_{x,r} is proved by invoking a coupling argument from [17, Lemma 4.1.3], with footnote 15 asserting that the argument adapts to the present path space. This adaptation is not carried out. Proposition 5.4 is used in the proof of the special Markov property under N_{x,r} (Proposition 8.1) and in the derivation of the boundary-size law (Proposition 8.9), so this is a load-bearing technical point that needs a complete proof.
- [Section 9, Theorem 9.1] The proof that the processes rX and rX' have identical jumps relies on the claim that the intervals (A_{a_i}, A_{b_i}) are the excursion intervals of rX' above its running infimum, justified only by the support characterization (9.2) and the equality (9.5). These facts are imported from [37, Theorem 5.1] and [37, Theorem 4.19]. While importing results from a companion paper is legitimate, the manuscript should state precisely which properties of the local time A and of the tree T_{H~} are taken from [37] and which are proved here, and it should provide the necessary consequences in a self-contained way. In particular, Lemma 9.2 extends A to N_{x,r} by using Theorem 7.3, but Theorem 7.3 itself already assumes the main properties of A under N_{x,0} from [37].
minor comments (3)
- [Section 2.2.2, equation (2.16)] The display for the decomposition of ρ_t appears to have a missing indicator: the atomic sum should be over 0 < s ≤ t with X_{s-} < I_{s,t}; as printed, the expression is incomplete.
- [Throughout] The symbol E is used both for the state space E = E × R_+ (Section 3) and for the excursion point measure E (Section 7.3). This is confusing; a different notation for one of these objects would improve readability.
- [Introduction, Section 7] Since the paper depends so heavily on the companion paper [37], a short table or list summarizing the main imported results (the local time A, the special Markov property, the law of the tree T_{H~}) and indicating where each is used would help the reader and the referees.
Circularity Check
No significant circularity: the Poisson excursion theorem is derived from the exit formula and special Markov property; reliance on the companion paper [37] is on distinct external theorems, not re-statements of the target result.
full rationale
The central claim, Theorem 7.5, is not circular. The proof checks the standard Poisson-point-measure criteria: point (i) follows from the exit formula Corollary 7.4, which is proved via spinal decompositions and the snake Markov property; point (ii) uses Corollary 7.1, which follows from Lemma 4.5 together with the support characterization imported from [37, Theorem 4.19]; point (iii) uses the special Markov property [37, Theorem 3.7] and the additive decomposition (7.29), based on equations (4.29)-(4.30) of [37], to transfer the A-indexing to the exit-local-time indexing. These are genuinely cited external theorems with their own proofs, not a restatement of Theorem 7.5 itself, so the derivation does not reduce to its inputs by construction. Similarly, Theorem 9.1 builds on [37, Theorem 5.1] but adds the identification of the rLévy process rX through boundary-size jumps, established via Proposition 8.9 and Lemma 9.3, rather than merely renaming the cited result. The consistency check against Abraham-Le Gall in Section 10 supplies independent external support. Caveats worth noting are proof-verification issues, not circularity: footnote 15 defers a coupling argument from [17] without proof, and Section 7.3 leaves the recovery of the pair (7.24) to the reader. These omissions affect completeness but do not make any step equivalent to its own input.
Assumptions & free parameters
assumptions (5)
- domain assumption Existence and properties of the local time A at x: (7.3) supp dA = [0,σ] \ C*, constancy intervals of A and Λ coincide, decomposition (7.4).
- domain assumption Special Markov property of the Lévy snake ([37, Theorem 3.7]) and its extension under the measures N_{x,r} (Proposition 8.1).
- domain assumption H̃ := Λ_{A^{-1}} is the height process of a ψ̃-Lévy forest with no Brownian component, with ψ̃ explicit from [37, Proposition 4.7].
- domain assumption Hypotheses (H1): x regular, instantaneous, recurrent for the spatial motion; (H2): zero occupation time of x, giving (3.4): the label process never hits x at branching points.
- domain assumption Hypothesis (H0)/(H1_0): there exist p,q > 0 with q(1-Υ^{-1}) > 1 bounding moments of the spatial motion; ensures the snake W has a continuous modification.
invented entities (3)
-
Excursion measures N_{x,r} (r ≥ 0) and N*_x
independent evidence
-
Boundary size ℓ_u of an excursion component (realized as exit local time L_σ under N*_x)
independent evidence
-
Tree coded by the local time T_{H̃}
independent evidence
Cite this review
Pith. "Pith review of Excursion theory for Markov processes indexed by Levy trees." pith.science (2026). https://pith.science/paper/DYU6IYMT
@misc{pith2026241112717,
author = {Pith},
title = {Pith review of: Excursion theory for Markov processes indexed by Levy trees},
year = {2026},
howpublished = {\url{https://pith.science/paper/DYU6IYMT}},
note = {Machine review of arXiv:2411.12717}
}
abstract
We develop an excursion theory that describes the evolution of a Markov process indexed by a Levy tree away from a regular and instantaneous point $x$ of the state space. The theory builds upon a notion of local time at $x$ that was recently introduced in [37]. Despite the radically different setting, our results exhibit striking similarities to the classical excursion theory for $\mathbb{R}_+$-indexed Markov processes. We then show that the genealogy of the excursions can be encoded in a Levy tree called the tree coded by the local time. In particular, we recover by different methods the excursion theory of Abraham and Le Gall [2], which was developed for Brownian motion indexed by the Brownian tree.
Forward citations
Cited by 1 Pith paper
-
The scaling limit of planar maps with large faces
Large Boltzmann planar maps with a stable exponent alpha converge in the Gromov-Hausdorff-Prokhorov sense to an explicit random compact metric space S_alpha of Hausdorff dimension 2 alpha.
Reference graph
Works this paper leans on
- [37]
-
[2]
C. Abraham, J.-F. Le Gall , Excursion theory for Brownian motion indexed by the Browni an tree. J. Eur. Math. Soc. 20, 2951–3016, (2018)
work page 2018
-
[17]
T. Duquesne, J.-F. Le Gall , Random trees, L´ evy processes and spatial branching proce sses. Ast´ erisque281, (2002)
work page 2002
-
[1]
R. Abraham, J.-F. Delmas , Feller property and infinitesimal generator of the explora tion process. J. Theor. Probab. 20, 355–370, (2007)
work page 2007
-
[3]
Aldous , The Continuum Random Tree
D. Aldous , The Continuum Random Tree. I. Ann. Probab. 19, 1–28, (1991)
work page 1991
-
[4]
Aldous , Tree-based models for random distribution of mass
D. Aldous , Tree-based models for random distribution of mass. J. Stat. Phys. 73, 625–641, (1993)
work page 1993
- [5]
-
[6]
T. Bai, X. Chen, Y. Hu , Boundary local times for critical branching random walk. In preparation
Show all 40 references
-
[7]
E. Baur, G. Miermont, G. Ray , Classification of scaling limits of uniform quadrangulati ons with a boundary. Ann. Probab. 47, 3397–3477, (2019)
2019
-
[8]
Bertoin, N
J. Bertoin, N. Curien, A. Riera , Self-similar Markov trees and scaling limits. arXiv preprint 407.07888, (2024)
2024
-
[9]
Bertoin, J.-F
J. Bertoin, J.-F. Le Gall, Y. Le Jan , Spatial branching processes and subordination. Canadian Journal of Mathematics. 49, 24–54, (1997)
1997
-
[10]
Bettinelli, G
J. Bettinelli, G. Miermont , Compact Brownian surfaces II. Orientable surfaces. arXiv preprint 2212.12511, (2022)
2022
-
[11]
Chen , Enumeration of fully parked trees
L. Chen , Enumeration of fully parked trees. arXiv preprint 2103.15770, (2021)
2021 arXiv
-
[12]
Contat, N
A. Contat, N. Curien , Parking on Cayley trees & frozen Erd˝ os–R´ enyi.Ann. Probab. 51, 1993–2055, (2023)
2023
-
[13]
Curien , Peeling random planar maps
N. Curien , Peeling random planar maps . ´Ecole d’´Et´ e de Probabilit´ es de Saint-Flour 2019, Lecture Notes in Mathematics, Springer, (2023)
2023
-
[14]
Curien, T
N. Curien, T. Hutchcroft, A. Nachmias , Geometric and spectral properties of causal maps. J. Eur. Math. Soc. 22 , 12, 3997–4024, (2020)
2020
-
[15]
Curien, J.-F
N. Curien, J.-F. Le Gall , First-passage percolation and local perturbations on ran dom planar maps. Ann. Sci. ´Ec. Norm. Sup´ er.3, 631–701, (2019)
2019
-
[16]
Duquesne , The coding of compact real trees by real valued functions
T. Duquesne , The coding of compact real trees by real valued functions. arXiv preprint 0604106, (2006) 62
2006
-
[18]
Duquesne, J.-F
T. Duquesne, J.-F. Le Gall , Probabilistic and fractal aspects of L´ evy trees. Probab. Theory Relat. Fields. 131, 553–603, (2005)
2005
-
[19]
S. N. Evans , Probability and real trees . Lecture Notes in Mathematics, Springer, (2008)
2008
-
[20]
Kallenberg , Foundations of modern probability, third edition
O. Kallenberg , Foundations of modern probability, third edition. Probability Theory and Stochastic Modelling, (2021)
2021
-
[21]
Kortchemski, C
I. Kortchemski, C. Marzouk , Random L´ evy Looptrees and L´ evy Maps.arXiv preprint 2402.04098, (2024)
2024 arXiv
-
[22]
A. E. Kyprianou , Fluctuations of L´ evy processes with applications: Introductory Lectures. Springer Science & Business Media, (2014)
2014
-
[23]
Le Gall , The uniform random tree in a Brownian excursion
J.-F. Le Gall , The uniform random tree in a Brownian excursion. Probab. Theory Relat. Fields 96, 369–383, (1993)
1993
-
[24]
Le Gall , Spatial Branching Processes, Random Snakes and Partial Diff erential Equations
J.-F. Le Gall , Spatial Branching Processes, Random Snakes and Partial Diff erential Equations . Lectures in Mathematics ETH Z¨ urich. Birkh¨ auser, Boston,(1999)
1999
-
[25]
Le Gall , Random trees and applications
J.-F. Le Gall , Random trees and applications. Probability Surveys, (2005)
2005
-
[26]
Le Gall , Uniqueness and universality of the Brownian map
J.-F. Le Gall , Uniqueness and universality of the Brownian map. Ann. Proba b. 41, 2880–2960, (2013)
2013
-
[27]
Le Gall , Subordination of trees and the Brownian map
J.-F. Le Gall , Subordination of trees and the Brownian map. Probab. Theory Relat. Fields 171, 819–864, (2018)
2018
-
[28]
Le Gall , Brownian disks and the Brownian snake
J.-F. Le Gall , Brownian disks and the Brownian snake. Ann. Inst. Henri Poincar´ e Probab. Stat.55, 237–313, (2019)
2019
-
[29]
Le Gall , Brownian geometry
J.-F. Le Gall , Brownian geometry. Japan. J. Math. 14, 135-174, (2019)
2019
-
[30]
Le Gall, Y
J.-F. Le Gall, Y. Le Jan , Branching processes in L´ evy processes: the exploration p rocess. Ann. Probab. 26, 213-252, (1998)
1998
-
[31]
Le Gall, A
J.-F. Le Gall, A. Riera , Growth-fragmentation processes in Brownian motion index ed by the Brownian tree. Ann. Probab. 48, 1742-1784, (2020)
2020
-
[32]
Le Gall, A
J.-F. Le Gall, A. Riera , Spine representations for non-compact models of random ge ometry. Probab. Theory Relat. Fields 181, 571-645, (2021)
2021
-
[33]
Maisonneuve , Exit systems
B. Maisonneuve , Exit systems. Ann. Probab. 3, 399–411, (1975)
1975
-
[34]
Marzouk , Scaling limits of discrete snakes with stable branching
C. Marzouk , Scaling limits of discrete snakes with stable branching. Ann. Inst. Henri Poincar´ e, Probab. Stat. 56, 502–523, (2020)
2020
-
[35]
Miermont , The Brownian map is the scaling limit of uniform random plan e quadrangulations, Acta Math
G. Miermont , The Brownian map is the scaling limit of uniform random plan e quadrangulations, Acta Math. 210, 319–401, (2013)
2013
-
[36]
Miller, S
J. Miller, S. Sheffield , An axiomatic characterization of the Brownian map. JEP. 8, 609-731, (2021)
2021
-
[38]
Royden, P
H. Royden, P. Fitzpatrick , Real Analysis, fourth edition. Pearson, (2010)
2010
-
[39]
Sharpe , General Theory of Markov Processes
M. Sharpe , General Theory of Markov Processes. Academic Press, (1988)
1988
-
[40]
Weill, Regenerative real trees
M. Weill, Regenerative real trees. Ann. Probab. 35, 2091–2121, (2007) 64
2007
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.