Reversal property of the Brownian tree
classification
🧮 math.PR
keywords
treebrownianreversalbecomingbranchingconsistsleavespoints
read the original abstract
We consider the Brownian tree introduced by Aldous and the associated Q-process which consists in an infinite spine on which are grafted independent Brownian trees. We present a reversal procedure on these trees that consists in looking at the tree downward from its top: the branching points becoming leaves and leaves becoming branching points. We prove that the distribution of the tree is invariant under this reversal procedure, which provides a better understanding of previous results from Bi and Delmas (2016).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.