September 2012 Tightness for maxima of generalized branching random walks
Ming Fang
Author Affiliations +
J. Appl. Probab. 49(3): 652-670 (September 2012). DOI: 10.1239/jap/1346955324

Abstract

We study generalized branching random walks on the real line R that allow time dependence and local dependence between siblings. Specifically, starting from one particle at time 0, the system evolves such that each particle lives for one unit amount of time, gives birth independently to a random number of offspring according to some branching law, and dies. The offspring from a single particle are assumed to move to new locations on R according to some joint displacement distribution; the branching laws and displacement distributions depend on time. At time n, Fn(·) is used to denote the distribution function of the position of the rightmost particle in generation n. Under appropriate tail assumptions on the branching laws and offspring displacement distributions, we prove that Fn(· - Med(Fn)) is tight in n, where Med(Fn) is the median of Fn. The main part of the argument is to demonstrate the exponential decay of the right tail 1 - Fn(· - Med(Fn)).

Citation

Download Citation

Ming Fang. "Tightness for maxima of generalized branching random walks." J. Appl. Probab. 49 (3) 652 - 670, September 2012. https://doi.org/10.1239/jap/1346955324

Information

Published: September 2012
First available in Project Euclid: 6 September 2012

zbMATH: 1261.60097
MathSciNet: MR3012090
Digital Object Identifier: 10.1239/jap/1346955324

Subjects:
Primary: 60G50
Secondary: 60J80

Keywords: Branching random walk , recursion , tightness

Rights: Copyright © 2012 Applied Probability Trust

JOURNAL ARTICLE
19 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.49 • No. 3 • September 2012
Back to Top