IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v18y2016i2d10.1007_s11009-015-9439-6.html
   My bibliography  Save this article

Waiting Time Distribution for the Emergence of Superpatterns

Author

Listed:
  • Anant P. Godbole

    (East Tennessee State University)

  • Martha Liendo

    (East Tennessee State University)

Abstract

Consider a sequence { X n } n = 1 ∞ $\{X_{n}\}_{n=1}^{\infty }$ of i.i.d. uniform random variables taking values in the alphabet set {1, 2,…, d}. A k-superpattern is a realization of { X n } n = 1 t $\{X_{n}\}_{n=1}^{t}$ that contains, as an embedded subsequence, each of the non-order-isomorphic subpatterns of length k. We focus on the (non-trivial) case of d = k = 3 and study the waiting time distribution of τ = inf { t ≥ 1 : { X n } n = 1 t is a superpattern } $\tau =\inf \{t\ge 1:\{X_{n}\}_{n=1}^{t}\ \text {is\ a\ superpattern}\}$ . Our restricted set-up leads to proofs that are very combinatorial in nature, since we are essentially conducting a string analysis.

Suggested Citation

  • Anant P. Godbole & Martha Liendo, 2016. "Waiting Time Distribution for the Emergence of Superpatterns," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 517-528, June.
    • Handle: RePEc:spr:metcap:v:18:y:2016:i:2:d:10.1007_s11009-015-9439-6
    DOI: 10.1007/s11009-015-9439-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-015-9439-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-015-9439-6?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. Graham J. G. Upton, 1994. "Picturing the 1992 British General Election," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 157(2), pages 231-252, March.
    2. Sunil Abraham & Greg Brockman & Stephanie Sapp & Anant P. Godbole, 2013. "Omnibus Sequences, Coupon Collection, and Missing Word Counts," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 363-378, June.
    3. David E. Altig & Jagadeesh Gokhale, 1994. "Health care reform from a generational perspective," Economic Commentary, Federal Reserve Bank of Cleveland, issue Apr.
    4. James C. Fu, 2012. "On the Distribution of the Number of Occurrences of an Order-Preserving Pattern of Length Three in a Random Permutation," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 831-842, September.
    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. Valdez, L.D. & Braunstein, L.A., 2022. "Emergent networks in fractional percolation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 594(C).
    2. James C. Fu & Yu-Fei Hsieh, 2015. "On the Distribution of the Length of the Longest Increasing Subsequence in a Random Permutation," Methodology and Computing in Applied Probability, Springer, vol. 17(2), pages 489-496, June.
    3. John Curtice & David Firth, 2008. "Exit polling in a cold climate: the BBC–ITV experience in Britain in 2005," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 171(3), pages 509-539, June.
    4. Michael Herrmann, 2012. "Voter uncertainty and failure of Duverger’s law: an empirical analysis," Public Choice, Springer, vol. 151(1), pages 63-90, April.
    5. Angel, Omer & Matzavinos, Anastasios & Roitershtein, Alexander, 2019. "Limit theorem for the Robin Hood game," Statistics & Probability Letters, Elsevier, vol. 149(C), pages 9-15.

    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:spr:metcap:v:18:y:2016:i:2:d:10.1007_s11009-015-9439-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.