Campuses:

Reception and poster session

Friday, August 5, 2005 - 6:00pm - 8:00pm
Lind 400
  • Inference with the median of a prior
    Adel Mohammadpour (Université de Paris XI (Paris-Sud))
  • Sub-independence for stable random variables
    Adel Mohammadpour (Université de Paris XI (Paris-Sud))
  • A state machine approach to study pattern frequencies in Markovian

    sequences

    Manuel Lladser (University of Colorado)
    We present a general method to compute the distribution of the number of occurrences of various patterns in a random string produced by a Markov process in a finite size alphabet. The key idea to the method is the observation that the probability of occurrence of a single pattern in a random string of length N corresponds to the probability that a random walk on a state machine (also known as automaton) visits a terminal state within N steps. Through a synchronization argument the method can be extended to study the occurrence of none, some, or all of a list of patterns in a random string generated by a homogeneous Markov Process with a bounded amount of memory. Within this framework the use of generating functions and matrix methods are readily available to determine explicitly or asymptotically the probability of simultaneous occurrence of various patterns in a random string of arbitrary length.