Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-06T22:56:53.677Z Has data issue: false hasContentIssue false

Extremes of multitype branching random walks: heaviest tail wins

Published online by Cambridge University Press:  07 August 2019

Ayan Bhattacharya*
Affiliation:
Centrum Wiskunde & Informatica
Krishanu Maulik*
Affiliation:
Indian Statistical Institute, Kolkata
Zbigniew Palmowski*
Affiliation:
Wrocław University of Science and Technology
Parthanil Roy*
Affiliation:
Indian Statistical Institute, Bangalore
*
*Postal address: Stochastics group, Centrum Wiskunde & Informatica, Amsterdam, North Holland, 1098 XG, Netherlands.
**Postal address: Statistics and Mathematics Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata 700108, India.
***Postal address: Faculty of Pure and Applied Mathematics, Wrocław University of Science and Technology, Ul. Wyb. Wyspiańskiego 27, 50-370 Wrocław, Poland.
****Postal address: Statistics and Mathematics Unit, Indian Statistical Institute, 8th Mile, Mysore Road, RVCE Post, Bangalore 560059, India.
Rights & Permissions [Opens in a new window]

Abstract

We consider a branching random walk on a multitype (with Q types of particles), supercritical Galton–Watson tree which satisfies the 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 the particles of type Q. In this paper we derive the weak limit of the sequence of point processes associated with the positions of the particles in the nth generation. We verify that the limiting point process is a randomly scaled scale-decorated Poisson point process using the tools developed by Bhattacharya, Hazra, and Roy (2018). As a consequence, we obtain the asymptotic distribution of the position of the rightmost particle in the nth generation.

Information

Type
Original Article
Copyright
© Applied Probability Trust 2019 
Figure 0

Figure 1. Cutting the Galton–Watson tree ($n=3, K=1$) at generation 2.

Figure 1

Figure 2. Pruning the Galton–Watson tree ($B=2, K=1$) at generation 2.

Figure 2

Figure 3. Regularizing pruned the Galton–Watson tree ($B=2, K=1$) at generation 2. The newly addded vertices in prunning are denoted by - -.