On patterns in sequences of random events

Monatshefte fur Mathematik

Volumn 127, Issue 4, 1999, Pages 295-309

  Gani, J ^a   Irle, A ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Avoidance of a pattern, markov chain; Independent trials; Markovian trials; Repetitions; Sequences of events

Indexed keywords

EID: 0040629669     PISSN: 00269255     EISSN: None     Source Type: Journal    
DOI: 10.1007/s006050050041     Document Type: Article

References (9)

1. BLOW G, THORBURN D (1982) How many random digits are required until given sequences are obtained? J Appl Prob 19: 518-531
2. FELLER W (1968) An Introduction to Probability Theory and its Applications, 3rd edn. New York: Wiley
3. Fu JC, KOUTRAS MV (1994) Distribution theory of runs: a Markov chain approach. J Amer Statist Assoc 89: 1050-1058
4. GANI J (1998). On sequences of events with repetitions. Stoch Models 14: 265-271
5. GUIBAS LJ, ODLYZKO AM (1981) String overlaps, pattern matching, and nontransitive games. J Combin Th A 30: 181-208
6. MOOD AM (1940) The distribution theory of runs. Ann Math Statist 11: 367-392
7. RÉNYI A (1984) Variation on a theme by Fibonacci. In: RÉNYI A (ed) A Diary on Information Theory, pp 85-104. Budapest: Akedemiai Kiado
8. SIEGEL D (1997). Bernoulli meets Fibonacci. Math Scientist 22: 122-124
9. VAJDA S (1989) Fibonacci and Lucas Numbers, and the Golden Section. Chichester: Halsted Press