IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v14y2012i3d10.1007_s11009-011-9234-y.html
   My bibliography  Save this article

1-Dependent Stationary Sequences for Some Given Joint Distributions of Two Consecutive Random Variables

Author

Listed:
  • George Haiman

    (Université de Lille 1, UFR de Mathématiques, Cité Scientifique)

Abstract

We provide a method to construct a 1-dependent stationary sequence provided some mixing condition on the joint distribution of two consecutive random variables. Two illustrations of computational benefits of the method are given. We obtain analytical formulas to compute the expectation and variance of the number of occurrences of a word in a sequence of letters from a finite alphabet generated by the 1-dependent model.We also obtain an approximation formula for the distribution of the longest success run in a Bernoulli sequence generated by our model.

Suggested Citation

  • George Haiman, 2012. "1-Dependent Stationary Sequences for Some Given Joint Distributions of Two Consecutive Random Variables," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 445-458, September.
  • Handle: RePEc:spr:metcap:v:14:y:2012:i:3:d:10.1007_s11009-011-9234-y
    DOI: 10.1007/s11009-011-9234-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-011-9234-y
    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-011-9234-y?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. Vaggelatou, Eutichia, 2003. "On the length of the longest run in a multi-state Markov chain," Statistics & Probability Letters, Elsevier, vol. 62(3), pages 211-221, April.
    2. Haiman, George, 1999. "First passage time for some stationary processes," Stochastic Processes and their Applications, Elsevier, vol. 80(2), pages 231-248, April.
    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. Haiman, George & Preda, Cristian, 2013. "One dimensional scan statistics generated by some dependent stationary sequences," Statistics & Probability Letters, Elsevier, vol. 83(5), pages 1457-1463.

    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. Serkan Eryilmaz, 2005. "On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials," Statistical Papers, Springer, vol. 46(1), pages 117-128, January.
    2. Qianzhu Wu & Joseph Glaz, 2019. "Robust Scan Statistics for Detecting a Local Change in Population Mean for Normal Data," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 295-314, March.
    3. Qianzhu Wu & Joseph Glaz, 2021. "Scan Statistics for Normal Data with Outliers," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 429-458, March.
    4. Jack Noonan & Anatoly Zhigljavsky, 2021. "Approximations for the Boundary Crossing Probabilities of Moving Sums of Random Variables," Methodology and Computing in Applied Probability, Springer, vol. 23(3), pages 873-892, September.
    5. Novak, S.Y., 2017. "On the length of the longest head run," Statistics & Probability Letters, Elsevier, vol. 130(C), pages 111-114.
    6. Alexandru Amărioarei & Cristian Preda, 2015. "Approximation for the Distribution of Three-dimensional Discrete Scan Statistic," Methodology and Computing in Applied Probability, Springer, vol. 17(3), pages 565-578, September.
    7. G. Haiman & C. Preda, 2006. "Estimation for the Distribution of Two-dimensional Discrete Scan Statistics," Methodology and Computing in Applied Probability, Springer, vol. 8(3), pages 373-382, September.
    8. George Haiman & Cristian Preda, 2010. "A New Method of Approximating the Probability of Matching Common Words in Multiple Random Sequences," Methodology and Computing in Applied Probability, Springer, vol. 12(4), pages 775-795, December.
    9. Haiman, George & Preda, Cristian, 2013. "One dimensional scan statistics generated by some dependent stationary sequences," Statistics & Probability Letters, Elsevier, vol. 83(5), pages 1457-1463.
    10. Ghosh, Souvik & Samorodnitsky, Gennady, 2010. "Long strange segments, ruin probabilities and the effect of memory on moving average processes," Stochastic Processes and their Applications, Elsevier, vol. 120(12), pages 2302-2330, December.
    11. EryIlmaz, Serkan, 2008. "Distribution of runs in a sequence of exchangeable multi-state trials," Statistics & Probability Letters, Elsevier, vol. 78(12), pages 1505-1513, September.
    12. Joseph Glaz & Joseph Naus & Xiao Wang, 2012. "Approximations and Inequalities for Moving Sums," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 597-616, September.
    13. G. Haiman & C. Preda, 2002. "A New Method for Estimating the Distribution of Scan Statistics for a Two-Dimensional Poisson Process," Methodology and Computing in Applied Probability, Springer, vol. 4(4), pages 393-407, December.

    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:14:y:2012:i:3:d:10.1007_s11009-011-9234-y. 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.