Markov properties for the vertical edge profile in random labelled trees
Alexis Metz-Donnadieu

TL;DR
This paper demonstrates that the vertical edge profile in a broad class of random labelled trees forms a Markov chain, providing explicit transition kernels and connecting to super-Brownian motion theory.
Contribution
It introduces the vertical edge profile as a Markovian structure in labelled trees and derives explicit transition kernels for incomplete binary trees.
Findings
Vertical edge profile forms a time-homogeneous Markov chain.
Enrichment with total mass yields Markovian structure conditioned on tree size.
Explicit transition kernels are provided for labelled incomplete binary trees.
Abstract
We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in . These models include e.g. branching random walks, embedded complete and incomplete binary trees, random Cayley and plane trees with uniform displacements along edges. Motivated by recent work suggesting a Markovian structure in the vertical profile of such trees, we introduce the vertical edge profile, which counts both oriented edges connecting label to label and oriented edges connecting label to label . We show that the vertical edge profile forms a time-homogeneous Markov chain for a wide class of models, and this remains true (provided we enrich this process by the total mass of the tree below each label) if we condition on the total size of the tree. We give explicit transition kernels in the case of labelled…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Random Matrices and Applications
