markov dependent trials
Recently Published Documents


TOTAL DOCUMENTS

29
(FIVE YEARS 0)

H-INDEX

9
(FIVE YEARS 0)

2018 ◽  
Vol 55 (4) ◽  
pp. 523-541
Author(s):  
Babita Goyal ◽  
Kanwar Sen

For fixed integers n(= 0) and μ, the number of ways in which a moving particle taking a horizontal step with probability p and a vertical step with probability q, touches the line Y = n+μX for the first time, have been counted. The concept has been applied to obtain various probability distributions in independent and Markov dependent trials.


2017 ◽  
Vol 47 (9) ◽  
pp. 2238-2250 ◽  
Author(s):  
Anastasios N. Arapis ◽  
Frosso S. Makri ◽  
Zaharias M. Psillakis

2017 ◽  
Vol 8 (1) ◽  
pp. 1-6 ◽  
Author(s):  
F.S. Makri ◽  
Z.M. Psillakis

In a 0 - 1 sequence of Markov dependent trials we consider a statistic which counts strings of a limited length run of 0s between subsequent 1s. Its probability mass function is used to determine the chance that a stochastic process remains or not in statistical control. Illustrative numerics are presented.


2014 ◽  
Vol 51 (01) ◽  
pp. 287-292 ◽  
Author(s):  
Renato Jacob Gava ◽  
Danilo Salotti

Consider a sequence of Markov-dependent trials where each trial produces a letter of a finite alphabet. Given a collection of patterns, we look at this sequence until one of these patterns appears as a run. We show how the method of gambling teams can be employed to compute the probability that a given pattern is the first pattern to occur.


2014 ◽  
Vol 51 (1) ◽  
pp. 287-292 ◽  
Author(s):  
Renato Jacob Gava ◽  
Danilo Salotti

Consider a sequence of Markov-dependent trials where each trial produces a letter of a finite alphabet. Given a collection of patterns, we look at this sequence until one of these patterns appears as a run. We show how the method of gambling teams can be employed to compute the probability that a given pattern is the first pattern to occur.


2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Kanwar Sen ◽  
Pooja Mohan ◽  
Manju Lata Agarwal

We use the Graphical Evaluation and Review Technique (GERT) to obtain probability generating functions of the waiting time distributions of 1st, and th nonoverlapping and overlapping occurrences of the pattern , involving homogenous Markov dependent trials. GERT besides providing visual picture of the system helps to analyze the system in a less inductive manner. Mean and variance of the waiting times of the occurrence of the patterns have also been obtained. Some earlier results existing in literature have been shown to be particular cases of these results.


2012 ◽  
Vol 03 (11) ◽  
pp. 1689-1696
Author(s):  
Bruce J. Chaderjian ◽  
Morteza Ebneshahrashoob ◽  
Tangan Gao

Sign in / Sign up

Export Citation Format

Share Document