The uniform random tree in a Brownian excursion (Q1326350)

To any Brownian excursion \(e\) with duration \(\sigma(e)\) and any \(t_ 1, \dots,t_ p \in [0,\sigma (e)]\), we associate a branching tree with \(p\) branches denoted by \(T_ p (e, t_ 1, \dots, t_ p)\), which is closely related to the structure of the minima of \(e\). Our main theorem states that, if \(e\) is chosen according to the Itô measure and \((t_ 1, \dots, t_ p)\) according to the Lebesgue measure on \([0,\sigma (e)]^ p\), the tree \(T_ p (e,t_ 1, \dots, t_ p)\) is distributed according to the uniform measure on the set of trees with \(p\) branches. The proof of this result yields additional information about the ``subexcursions'' of \(e\) corresponding to the different branches of the tree, thus generalizing a well-known representation theorem of \textit{J.-M. Bismut} [Z. Wahrscheinlichkeitstheorie Verw. Geb. 69, 65-98 (1985; Zbl 0551.60077)]. If we replace the Itô measure by the law of the normalized excursion, a simple conditioning argument leads to another remarkable result originally proved by \textit{D. J. Aldous} [Ann. Probab. 19, No. 1, 1-28 (1991; Zbl 0722.60013), Stochastic analysis, Proc. Symp., Durham/UK 1990, Lond. Math. Soc. Lect. Note Ser. 167, 23-70 (1991; Zbl 0791.60008) and Ann. Probab. 21, No. 1, 248-289 (1993; Zbl 0791.60009)] with a very different method.