In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slanted]1) occurrence of a compound pattern with respect to nonoverlapping and overlapping counting schemes in a sequence of Markov dependent multistate trials. Based on the finite Markov chain imbedding approach, the exact distribution, mean, variance and probability generating function are obtained. In addition, an alternative way of finding the probability generating function is presented.Waiting time Compound pattern Finite Markov chain imbedding Probability generating function
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
In this paper we consider the distribution of a pattern of interest in a binary random (d, k)-sequen...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
On waiting time distributions associated with compound patterns in a sequence of multi-state trial
[[abstract]]In this thesis, we are mainly concerned with the expected waiting time of certain patter...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
A binary sequence of zeros and ones is called a (d,k)-sequence if it does not contain runs of zer...
Analysis of AlgorithmsA binary sequence of zeros and ones is called a (d; k)-sequence if it does not...
[[abstract]]Two applications of waiting time distributions associated with compound patterns are pre...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
In this paper we consider the distribution of a pattern of interest in a binary random (d, k)-sequen...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
On waiting time distributions associated with compound patterns in a sequence of multi-state trial
[[abstract]]In this thesis, we are mainly concerned with the expected waiting time of certain patter...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
A binary sequence of zeros and ones is called a (d,k)-sequence if it does not contain runs of zer...
Analysis of AlgorithmsA binary sequence of zeros and ones is called a (d; k)-sequence if it does not...
[[abstract]]Two applications of waiting time distributions associated with compound patterns are pre...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...