IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v128y2018i1p182-210.html
   My bibliography  Save this article

Branching random walks, stable point processes and regular variation

Author

Listed:
  • Bhattacharya, Ayan
  • Hazra, Rajat Subhra
  • Roy, Parthanil

Abstract

Using the theory of regular variation, we give a sufficient condition for a point process to be in the superposition domain of attraction of a strictly stable point process. This sufficient condition is used to obtain the weak limit of a sequence of point processes induced by a branching random walk with jointly regularly varying displacements. Because of heavy tails of the step size distribution, we can invoke a one large jump principle at the level of point processes to give an explicit representation of the limiting point process. As a consequence, we extend the main result of Durrett (1983) and verify that two related predictions of Brunet and Derrida (2011) remain valid for this model.

Suggested Citation

  • Bhattacharya, Ayan & Hazra, Rajat Subhra & Roy, Parthanil, 2018. "Branching random walks, stable point processes and regular variation," Stochastic Processes and their Applications, Elsevier, vol. 128(1), pages 182-210.
  • Handle: RePEc:eee:spapps:v:128:y:2018:i:1:p:182-210
    DOI: 10.1016/j.spa.2017.04.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414917301230
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spa.2017.04.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fasen, Vicky & Roy, Parthanil, 2016. "Stable random fields, point processes and large deviations," Stochastic Processes and their Applications, Elsevier, vol. 126(3), pages 832-856.
    2. Durrett, Richard, 1979. "Maxima of branching random walks vs. independent random walks," Stochastic Processes and their Applications, Elsevier, vol. 9(2), pages 117-135, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ekaterina Vl. Bulinskaya, 2021. "Maximum of Catalytic Branching Random Walk with Regularly Varying Tails," Journal of Theoretical Probability, Springer, vol. 34(1), pages 141-161, March.
    2. Ray, Souvik & Hazra, Rajat Subhra & Roy, Parthanil & Soulier, Philippe, 2023. "Branching random walk with infinite progeny mean: A tale of two tails," Stochastic Processes and their Applications, Elsevier, vol. 160(C), pages 120-160.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zakhar Kabluchko, 2012. "Limit Laws for Sums of Independent Random Products: the Lattice Case," Journal of Theoretical Probability, Springer, vol. 25(2), pages 424-437, June.
    2. Panigrahi, Snigdha & Roy, Parthanil & Xiao, Yimin, 2021. "Maximal moments and uniform modulus of continuity for stable random fields," Stochastic Processes and their Applications, Elsevier, vol. 136(C), pages 92-124.
    3. Gajda, J. & Wyłomańska, A. & Kantz, H. & Chechkin, A.V. & Sikora, G., 2018. "Large deviations of time-averaged statistics for Gaussian processes," Statistics & Probability Letters, Elsevier, vol. 143(C), pages 47-55.
    4. Viktor Bezborodov & Luca Persio & Tyll Krueger, 2021. "A Shape Theorem for a One-Dimensional Growing Particle System with a Bounded Number of Occupants per Site," Journal of Theoretical Probability, Springer, vol. 34(4), pages 2265-2284, December.
    5. Engelke, Sebastian & Kabluchko, Zakhar, 2015. "Max-stable processes and stationary systems of Lévy particles," Stochastic Processes and their Applications, Elsevier, vol. 125(11), pages 4272-4299.
    6. Ray, Souvik & Hazra, Rajat Subhra & Roy, Parthanil & Soulier, Philippe, 2023. "Branching random walk with infinite progeny mean: A tale of two tails," Stochastic Processes and their Applications, Elsevier, vol. 160(C), pages 120-160.
    7. Parthanil Roy, 2017. "Maxima of stable random fields, nonsingular actions and finitely generated abelian groups: A survey," Indian Journal of Pure and Applied Mathematics, Springer, vol. 48(4), pages 513-540, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:128:y:2018:i:1:p:182-210. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.