Add to ORKGMethods using gambling teams and martingales are developed and applied to find formulas for the expected value and the generating function of the waiting time until one observes an element of a finite collection of patterns in a sequence which is generated by a two-state first or higher order Markov chain
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slan...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
A martingale argument is used to derive the generating function of the number of i.i.d. experiments ...
AbstractA martingale argument is used to derive the generating function of the number of i.i.d. expe...
AbstractLet X be an ergodic Markov chain on a finite state space S0 and let s and t be finite sequen...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
Consideremos uma sequência de lançamentos de moedas em que denotamos o resultado de cada lançamento ...
[[abstract]]In this thesis we mainly aim to compute the expected waiting time of a certain pattern i...
Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C0...
Abstract. The expected value and generating function of the number of over-lapping occurrences of a ...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slan...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
A martingale argument is used to derive the generating function of the number of i.i.d. experiments ...
AbstractA martingale argument is used to derive the generating function of the number of i.i.d. expe...
AbstractLet X be an ergodic Markov chain on a finite state space S0 and let s and t be finite sequen...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
Consideremos uma sequência de lançamentos de moedas em que denotamos o resultado de cada lançamento ...
[[abstract]]In this thesis we mainly aim to compute the expected waiting time of a certain pattern i...
Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C0...
Abstract. The expected value and generating function of the number of over-lapping occurrences of a ...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slan...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...