IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i11p2571-d1163551.html
   My bibliography  Save this article

Percolation Problems on N -Ary Trees

Author

Listed:
  • Tianxiang Ren

    (Institute of Management, University of Science and Technology of China, Heifei 230026, China)

  • Jinwen Wu

    (Institute of Management, University of Science and Technology of China, Heifei 230026, China)

Abstract

Percolation theory is a subject that has been flourishing in recent decades. Because of its simple expression and rich connotation, it is widely used in chemistry, ecology, physics, materials science, infectious diseases, and complex networks. Consider an infinite-rooted N -ary tree where each vertex is assigned an i.i.d. random variable. When the random variable follows a Bernoulli distribution, a path is called head run if all the random variables that are assigned on the path are 1. We obtain the weak law of large numbers for the length of the longest head run. In addition, when the random variable follows a continuous distribution, a path is called an increasing path if the sequence of random variables on the path is increasing. By Stein’s method and other probabilistic methods, we prove that the length of the longest increasing path with a probability of one focuses on three points. We also consider limiting behaviours for the longest increasing path in a special tree.

Suggested Citation

  • Tianxiang Ren & Jinwen Wu, 2023. "Percolation Problems on N -Ary Trees," Mathematics, MDPI, vol. 11(11), pages 1-14, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2571-:d:1163551
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/11/2571/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/11/2571/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Novak, S.Y., 2017. "On the length of the longest head run," Statistics & Probability Letters, Elsevier, vol. 130(C), pages 111-114.
    2. Yong-Hua Mao & Feng Wang & Xian-Yuan Wu, 2015. "Large Deviation Behavior for the Longest Head Run in an IID Bernoulli Sequence," Journal of Theoretical Probability, Springer, vol. 28(1), pages 259-268, March.
    Full references (including those not matched with items on IDEAS)

    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. Fazekas, István & Fazekas, Borbála & Suja, Michael Ochieng, 2024. "Convergence rate for the longest T-contaminated runs of heads," Statistics & Probability Letters, Elsevier, vol. 208(C).
    2. Yaakov Malinovsky, 2022. "A Note on the Closed-Form Solution for the Longest Head Run Problem of Abraham de Moivre," The Mathematical Intelligencer, Springer, vol. 44(3), pages 267-268, September.

    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:gam:jmathe:v:11:y:2023:i:11:p:2571-:d:1163551. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.