Papers
Topics
Authors
Recent
Search
2000 character limit reached

A revisited proof of the Seneta-Heyde norming for branching random walks under optimal assumptions

Published 14 Feb 2019 in math.PR | (1902.05330v3)

Abstract: We introduce a set of tools which simplify and streamline the proofs of limit theorems concerning near-critical particles in branching random walks under optimal assumptions. We exemplify our method by giving another proof of the Seneta-Heyde norming for the critical additive martingale, initially due to A\"id\'ekon and Shi. The method involves in particular the replacement of certain second moment estimates by truncated first moment bounds, and the replacement of ballot-type theorems for random walks by estimates coming from an explicit expression for the potential kernel of random walks killed below the origin. Of independent interest might be a short, self-contained proof of this expression, as well as a criterion for convergence in probability of non-negative random variables in terms of conditional Laplace transforms.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.