Open Access
Translator Disclaimer
November, 1992 Decomposing the Branching Brownian Path
Kalvis M. Jansons, L. C. G. Rogers
Ann. Appl. Probab. 2(4): 973-986 (November, 1992). DOI: 10.1214/aoap/1177005584


We consider a real-valued branching Brownian motion where particles are killed at rate $\mu$ and split at rate $\lambda \leq \mu$ into two independent offspring particles. The process dies out almost surely, so it reaches some lowest level. We prove a decomposition of the branching Brownian path at its minimum. The post-minimum path is just branching Brownian motion conditioned never to go beneath its initial point. The pre-minimum piece is independent of the post-minimum piece, and has the same law as the post-minimum piece reweighted by a functional of the endpoints of the tree. Applications to branching polymers are discussed.


Download Citation

Kalvis M. Jansons. L. C. G. Rogers. "Decomposing the Branching Brownian Path." Ann. Appl. Probab. 2 (4) 973 - 986, November, 1992.


Published: November, 1992
First available in Project Euclid: 19 April 2007

zbMATH: 0771.60057
MathSciNet: MR1189426
Digital Object Identifier: 10.1214/aoap/1177005584

Primary: 60J65
Secondary: 60J70 , 60J85

Keywords: Branching Brownian motion , branching polymers , branching tree with heights , post-minimum , pre-minimum , rooted branching tree with heights , rooted family tree with heights , Super-Brownian motion , tree shape with heights

Rights: Copyright © 1992 Institute of Mathematical Statistics


Vol.2 • No. 4 • November, 1992
Back to Top