Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-13T05:32:59.198Z Has data issue: false hasContentIssue false
  • English
  • Français

The detection of words and an ordering for Markov chains

Part of: Markov processes

Published online by Cambridge University Press:  14 July 2016

Albrecht Irle  and
Joseph Gani
Albrecht Irle*
Affiliation:
Christian-Albrechts-Universität
Joseph Gani*
Affiliation:
The Australian National University
*
1Postal address: Dept Mathematics and Statistics, Christian-Albrechts-Universitat, Kiel, Germany. Email: irle@math.uni-kiel.de
2Postal address: Centre for Mathematics and Applications (SMS), The Australian National University, Canberra ACT 0200, Australia. Email: gani@maths.anu.edu.au
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers the occurrence of patterns in sequences of independent trials from a finite alphabet; Gani and Irle (1999) have described a finite state automaton which identifies exactly those sequences of symbols containing the specific pattern, which may be thought of as the word of interest. Each word generates a particular Markov chain. Motivated by a result of Guibas and Odlyzko (1981) on stochastic monotonicity for the random times when a particular word is completed for the first time, a new level-crossing ordering is introduced for stochastic processes. A process {Yn : n = 0, 1, …} is slower in level-crossing than a process {Zn}, if it takes {Yn} stochastically longer than {Zn} to exceed any given level. This relation is shown to be useful for the comparison of stochastic automata, and is used to investigate this ordering for Markov chains in discrete time.

Keywords

Patternsstochastic automatastochastic orderinglevel-crossing

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 60J27: Continuous-time Markov processes on discrete state spaces
Type
Markov chains
Information
Journal of Applied Probability , Volume 38 , Issue A: Probability, Statistics and Seismology , 2001 , pp. 66 - 77
Copyright
Copyright © Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blom, G. (1984). On the stochastic ordering of waiting times for patterns in sequences of random digits. J. Appl. Probab. 21, 730–737.CrossRefGoogle Scholar
Blom, G. and Thorburn, D. (1982). How many random digits are required until given sequences are obtained? J. Appl. Probab. 19, 518–531.Google Scholar
Daley, D. J. (1968). Stochastically monotone Markov chains. Z. Wahrscheinlichkeitsth. 10, 305–317.Google Scholar
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050–1058.Google Scholar
Gani, J. and Irle, A. (1999). On patterns in sequences of random events. Monatsh. Math. 127, 295–309.Google Scholar
Guibas, L. J. and Odlyzko, A. M. (1981). String overlaps, pattern matching, and nontransitive games. J. Combin. Theory A 30, 181–208.Google Scholar
Shared, M. and Shanthikumar, J. G. (1994). Stochastic Orders and Their Applications. Academic Press, Boston.Google Scholar
Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. Wiley, Chichester. (Translation from the German edited by Daley, D. J.).Google Scholar