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

Lindley-type equations in the branching random walk

Author

Listed:
  • Biggins, J. D.

Abstract

An analogue of the Lindley equation for random walk is studied in the context of the branching random walk, taking up the studies of Karpelevich, Kelbert and Suhov [(1993a) In: Boccara, N., Goles, E., Martinez, S., Picco, P. (Eds.), Cellular Automata and Cooperative Behaviour. Kluwer, Dordrecht, pp. 323-342; (1994a) Stochast. Process. Appl. 53, 65-96]. The main results are: (i) close to necessary conditions for the equation to have a solution, (ii) mild conditions for there to be a one-parameter family of solutions and (iii) mild conditions for this family to be the only possible solutions.

Suggested Citation

  • Biggins, J. D., 1998. "Lindley-type equations in the branching random walk," Stochastic Processes and their Applications, Elsevier, vol. 75(1), pages 105-133, June.
    • Handle: RePEc:eee:spapps:v:75:y:1998:i:1:p:105-133
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(98)00016-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Karpelevich, F. I. & Kelbert, M. Ya. & Suhov, Yu. M., 1994. "Higher-order Lindley equations," Stochastic Processes and their Applications, Elsevier, vol. 53(1), pages 65-96, September.
    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. Iksanov, Alexander & Kolesko, Konrad & Meiners, Matthias, 2019. "Stable-like fluctuations of Biggins’ martingales," Stochastic Processes and their Applications, Elsevier, vol. 129(11), pages 4480-4499.
    2. Mariana Olvera-Cravioto & Octavio Ruiz-Lacedelli, 2021. "Stationary Waiting Time in Parallel Queues with Synchronization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 1-27, February.
    3. Jelenković, Predrag R. & Olvera-Cravioto, Mariana, 2015. "Maximums on trees," Stochastic Processes and their Applications, Elsevier, vol. 125(1), pages 217-232.
    4. Onno Boxma & Andreas Löpker & Michel Mandjes & Zbigniew Palmowski, 2021. "A multiplicative version of the Lindley recursion," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 225-245, August.
    5. Fraiman, Nicolas & Lin, Tzu-Chi & Olvera-Cravioto, Mariana, 2023. "Stochastic recursions on directed random graphs," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    6. Basrak, Bojan & Conroy, Michael & Olvera-Cravioto, Mariana & Palmowski, Zbigniew, 2022. "Importance sampling for maxima on trees," Stochastic Processes and their Applications, Elsevier, vol. 148(C), pages 139-179.

    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. Fraiman, Nicolas & Lin, Tzu-Chi & Olvera-Cravioto, Mariana, 2023. "Stochastic recursions on directed random graphs," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    2. Basrak, Bojan & Conroy, Michael & Olvera-Cravioto, Mariana & Palmowski, Zbigniew, 2022. "Importance sampling for maxima on trees," Stochastic Processes and their Applications, Elsevier, vol. 148(C), pages 139-179.
    3. Mariana Olvera-Cravioto & Octavio Ruiz-Lacedelli, 2021. "Stationary Waiting Time in Parallel Queues with Synchronization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 1-27, February.
    4. Jelenković, Predrag R. & Olvera-Cravioto, Mariana, 2015. "Maximums on trees," Stochastic Processes and their Applications, Elsevier, vol. 125(1), pages 217-232.
    5. Onno Boxma & Andreas Löpker & Michel Mandjes & Zbigniew Palmowski, 2021. "A multiplicative version of the Lindley recursion," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 225-245, August.

    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:75:y:1998:i:1:p:105-133. 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.