Exact Convergence Rates For The Distribution of Particles in Branching Random Walks
نویسندگان
چکیده
منابع مشابه
Exact convergence rates in central limit theorems for a branching random walk with a random environment in time
Chen [Ann. Appl. Probab. 11 (2001), 1242–1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process. We extend Chen’s results to a branching random walk under weaker moment conditions. For the branching Wiener process, our results sharpen Chen’s by relaxing the second moment condition used by Chen to a moment condition...
متن کاملBranching Random Walks
We study a generalized branching random walk where particles breed at a rate which depends on the number of neighbouring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a non trivial invariant measure for this case.
متن کاملMinima in Branching Random Walks
Given a branching random walk, let Mn be the minimum position of any member of the n’th generation. We calculate EMn to within O(1) and prove exponential tail bounds for P {|Mn − EMn| > x}, under quite general conditions on the branching random walk. In particular, together with work of [8], our results fully characterize the possible behavior of EMn when the branching random walk has bounded b...
متن کاملMaxima of Branching Random Walks
In recent years several authors have obtained limit theorems for Ln, the location of the rightmost particle in a supercritical branching random walk but all of these results have been proved under the assumption that the offspring distribution has (p(O)=.fexp(Ox)dF(x)0. In this paper we investigate what happens when there is a slowly varying function K so that 1-F(x)~x-qK(x) as x...
متن کاملBranching Random Walks on Graphs
We study a new distributed randomized information propagation mechanism in networks that we call a branching random walk (BRW). BRW is a generalization of the well-studied “standard” random walk which is a fundamental primitive useful in a wide variety of network applications ranging from token management and load balancing to search, routing, information propagation and gossip. BRW is paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2001
ISSN: 1050-5164
DOI: 10.1214/aoap/1015345402