IDEAS home Printed from https://ideas.repec.org/a/taf/mpopst/v30y2023i2p73-94.html
   My bibliography  Save this article

Branching random walk in a random time-independent environment

Author

Listed:
  • Elena Chernousova
  • Ostap Hryniv
  • Stanislav Molchanov

Abstract

In a lattice population model, particles move randomly from one site to another as independent random walks, split into two offspring, or die. If duplication and mortality rates are equal and take the same value over all lattice sites, the resulting model is a critical branching random walk (characterized by a mean total number of offspring equal to $$1$$1). There exists an asymptotical statistical equilibrium, also called steady state. In contrast, when duplication and mortality rates take independent random values drawn from a common nondegenerate distribution (so that the difference between duplication and mortality rates has nonzero variance), then the steady state no longer exists. Simultaneously, at all lattice sites, if the difference between duplication and mortality rates takes strictly positive values with strictly positive probability, the total number of particles grows exponentially. The lattice $${{\mathbb Z}^d}$$Zd includes large connected sets where the duplication rate exceeds the mortality rate by a positive constant amount, and these connected sets provide the growth of the total population. This is the supercritical regime of branching processes. On the other hand, if the difference between duplication and mortality rates is almost surely negative or null except when it is almost surely zero, then the total number of particles vanishes asymptotically. The steady state can be reached only if the difference between duplication and mortality rates is almost surely zero.

Suggested Citation

  • Elena Chernousova & Ostap Hryniv & Stanislav Molchanov, 2023. "Branching random walk in a random time-independent environment," Mathematical Population Studies, Taylor & Francis Journals, vol. 30(2), pages 73-94, April.
  • Handle: RePEc:taf:mpopst:v:30:y:2023:i:2:p:73-94
    DOI: 10.1080/08898480.2022.2140561
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/08898480.2022.2140561
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/08898480.2022.2140561?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:mpopst:v:30:y:2023:i:2:p:73-94. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GMPS20 .

    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.