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

A note on the gambling team method

Author

Listed:
  • Zajkowski, Krzysztof

Abstract

Gerber and Li (1981) formulated, using a Markov chain embedding, a system of equations that describes relations between generating functions of waiting time distributions for occurrences of patterns in a sequence of independent repeated experiments when the initial outcomes of the process are known. We show how this system of equations can be obtained by using the classical gambling team technique. We also present a form of solution of the system and give an example showing how first results of trials influence the probabilities that a chosen pattern precedes the remaining ones in a realization of the process.

Suggested Citation

  • Zajkowski, Krzysztof, 2014. "A note on the gambling team method," Statistics & Probability Letters, Elsevier, vol. 85(C), pages 45-50.
    • Handle: RePEc:eee:stapro:v:85:y:2014:i:c:p:45-50
    DOI: 10.1016/j.spl.2013.11.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715213003647
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2013.11.003?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. Vladimir Pozdnyakov & Joseph Glaz & Martin Kulldorff & J. Steele, 2005. "A martingale approach to scan statistics," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 57(1), pages 21-37, March.
    2. Gerber, Hans U. & Li, Shuo-Yen Robert, 1981. "The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain," Stochastic Processes and their Applications, Elsevier, vol. 11(1), pages 101-108, March.
    3. Pozdnyakov, Vladimir, 2008. "On occurrence of patterns in Markov chains: Method of gambling teams," Statistics & Probability Letters, Elsevier, vol. 78(16), pages 2762-2767, November.
    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. Pozdnyakov, Vladimir, 2008. "On occurrence of patterns in Markov chains: Method of gambling teams," Statistics & Probability Letters, Elsevier, vol. 78(16), pages 2762-2767, November.
    2. Bara Kim & Jeongsim Kim & Jerim Kim, 2020. "Waiting Time Problems for Patterns in a Sequence of Multi-State Trials," Mathematics, MDPI, vol. 8(11), pages 1-16, October.
    3. Fisher, Evan & Cui, Shiliang, 2010. "Patterns generated by -order Markov chains," Statistics & Probability Letters, Elsevier, vol. 80(15-16), pages 1157-1166, August.
    4. Markos V. Koutras & Demetrios P. Lyberopoulos, 2018. "Asymptotic results for jump probabilities associated to the multiple scan statistic," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(5), pages 951-968, October.
    5. Masayuki Uchida, 1998. "On Generating Functions of Waiting Time Problems for Sequence Patterns of Discrete Random Variables," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 50(4), pages 655-671, December.
    6. Glaz, Joseph & Zhang, Zhenkui, 2006. "Maximum scan score-type statistics," Statistics & Probability Letters, Elsevier, vol. 76(13), pages 1316-1322, July.
    7. Sharma, Dheeraj & Talpur, Mir Ghulam Haider, 2016. "An Examination of One Dimension Marginal Distributions: Selling and Non-selling Activities of a Salesperson," IIMA Working Papers WP2016-03-48, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Ourania Chryssaphinou & Stavros Papastavridis & Eutichia Vaggelatou, 1999. "On the Number of Appearances of a Word in a Sequence of I.I.D. Trials," Methodology and Computing in Applied Probability, Springer, vol. 1(3), pages 329-348, October.
    9. Anthony Cheng & Disheng Mao & Yuping Zhang & Joseph Glaz & Zhengqing Ouyang, 2023. "Translocation detection from Hi‐C data via scan statistics," Biometrics, The International Biometric Society, vol. 79(2), pages 1306-1317, 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:85:y:2014:i:c:p:45-50. 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.