Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Extremes of Multi-type Branching Random Walks: Heaviest Tail Wins (1612.00692v2)

Published 2 Dec 2016 in math.PR

Abstract: We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of index $\alpha$, while the other types of particles have lighter tails than that of particles of type $Q$. In this article, we derive the weak limit of the sequence of point processes associated with the positions of the particles in the $n{th}$ generation. We verify that the limiting point process is a randomly scaled scale-decorated Poisson point process (SScDPPP) using the tools developed in \cite{bhattacharya:hazra:roy:2016}. As a consequence, we shall obtain the asymptotic distribution of the position of the rightmost particle in the $n{th}$ generation.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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