Branching random walk and log-slowly varying tails
Ayan Bhattacharya, Piotr Dyszewski, Nina Gantert, and Zbigniew, Palmowski

TL;DR
This paper analyzes a branching random walk with heavy-tailed displacements outside the classical extreme value domain, showing that after a non-linear transformation, the extremes converge to a cluster Cox process.
Contribution
It extends the analysis of branching random walks to heavy-tailed displacements with log-slowly varying tails, beyond classical extreme value theory.
Findings
Extremes converge to a cluster Cox process after transformation
Classical extreme value theory does not apply in this setting
Heavy tails with log-slow variation can be effectively analyzed
Abstract
We study a branching random walk with independent and identically distributed, heavy tailed displacements. The offspring law is supercritical and satisfies the Kesten-Stigum condition. We treat the case when the law of the displacements does not lie in the max-domain of attraction of an extreme value distribution. Hence, the classical extreme value theory, which is often deployed in this kind of models, breaks down. We show that if the tails of the displacements are such that the absolute value of the logarithm of the tail is a slowly varying function, one can still effectively analyse the extremes of the process. More precisely, after a non-linear transformation the extremes of the branching random walk process converge to a cluster Cox process.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics
