IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v81y2011i2p302-309.html
   My bibliography  Save this article

Finite size percolation in regular trees

Author

Listed:
  • Arias-Castro, Ery

Abstract

In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.

Suggested Citation

  • Arias-Castro, Ery, 2011. "Finite size percolation in regular trees," Statistics & Probability Letters, Elsevier, vol. 81(2), pages 302-309, February.
    • Handle: RePEc:eee:stapro:v:81:y:2011:i:2:p:302-309
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(10)00303-2
    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. Chen, Jihong & Huo, Xiaoming, 2006. "Distribution of the Length of the Longest Significance Run on a Bernoulli Net and Its Applications," Journal of the American Statistical Association, American Statistical Association, vol. 101, pages 321-331, 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. James C. Fu & W. Y. Wendy Lou, 2007. "On the Normal Approximation for the Distribution of the Number of Simple or Compound Patterns in a Random Sequence of Multi-state Trials," Methodology and Computing in Applied Probability, Springer, vol. 9(2), pages 195-205, June.

    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:stapro:v:81:y:2011:i:2:p:302-309. 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/622892/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.