Displaying similar documents to “Markov Chains Connected to the Process of Generation of the Words by a Generative System”

On the number of word occurrences in a semi-Markov sequence of letters

Margarita Karaliopoulou (2009)

ESAIM: Probability and Statistics

Similarity:

Let a finite alphabet . We consider a sequence of letters from generated by a discrete time semi-Markov process { Z γ ; γ } . We derive the probability of a word occurrence in the sequence. We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain conditions.

Fast simulation for road traffic network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.