Splitting Trees Stopped when the First Clock Rings and Vervaat's Transformation
DOI10.1239/jap/1363784434zbMath1277.60140arXiv1110.2929MaRDI QIDQ4918573
Amaury Lambert, Pieter Trapman
Publication date: 25 April 2013
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.2929
sampling; resolvent; branching process; Lévy process; scale function; detection; epidemiology; processor sharing; Crump-Mode-Jagers process; splitting tree; contour process; Vervaat's transformation; age and residual lifetime; undershoot and overshoot
60G51: Processes with independent increments; Lévy processes
92D30: Epidemiology
60K25: Queueing theory (aspects of probability theory)
60J85: Applications of branching processes
92D25: Population dynamics (general)
60K15: Markov renewal processes, semi-Markov processes
60G17: Sample path properties
92D40: Ecology
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
92D10: Genetics and epigenetics
60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
- Species abundance distributions in neutral models with immigration or mutation and general lifetimes
- Splitting trees with neutral Poissonian mutations. I: Small families
- A useful relationship between epidemiology and queueing theory: The distribution of the number of infectives at the moment of the first detection
- The M/G/1 processor-sharing model: Transient behavior
- Exponential decay and ergodicity of completely asymmetric Lévy processes in a finite interval
- Splitting trees with neutral Poissonian mutations. II: Largest and oldest families
- The contour of splitting trees is a Lévy process
- Introductory lectures on fluctuations of Lévy processes with applications.
- The allelic partition for coalescent point processes
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes