Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T20:12:30.212Z Has data issue: false hasContentIssue false

Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains

Published online by Cambridge University Press:  14 July 2016

Joseph Glaz*
Affiliation:
University of Connecticut
Martin Kulldorff*
Affiliation:
Harvard Medical School and Harvard Pilgrim Health Care
Vladimir Pozdnyakov*
Affiliation:
University of Connecticut
J. Michael Steele*
Affiliation:
University of Pennsylvania
*
∗ Postal address: Department of Statistics, University of Connecticut, 215 Glenbrook Road, U-4120, Storrs, CT 06269-4120, USA.
∗∗ Postal address: Department of Ambulatory Care and Prevention, Harvard Medical School, 133 Brookline Avenue, Boston, MA 02215-3920, USA.
∗ Postal address: Department of Statistics, University of Connecticut, 215 Glenbrook Road, U-4120, Storrs, CT 06269-4120, USA.
∗∗∗∗ Postal address: Department of Statistics, Wharton School, Huntsman Hall 447, University of Pennsylvania, Philadelphia, PA 19104, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Methods using gambling teams and martingales are developed and applied to find formulae for the expected value and the generating function of the waiting time to observation of an element of a finite collection of patterns in a sequence generated by a two-state Markov chain of first, or higher, order.

Information

Type
Research Papers
Copyright
© Applied Probability Trust 2006