Some Sufficient Conditions for Stochastic Comparisons Between Hitting Times for Skip-free Markov Chains-Reference-Cited by-同舟云学术

Some Sufficient Conditions for Stochastic Comparisons Between Hitting Times for Skip-free Markov Chains

Published:2016-02-18 Issue:4 Volume:18 Page:1021-1034
ISSN:1387-5841
Container-title:Methodology and Computing in Applied Probability
language:en
Short-container-title:Methodol Comput Appl Probab

Author:

Santis Emilio De,Spizzichino Fabio^ORCID

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/s11009-016-9486-7.pdf

Reference21 articles.

1. Blom G, Thorburn D (1982) How many random digits are required until given sequences are obtained. J Appl Probab 19(3):518–531

2. Blom G (1984) On the stochastic ordering of waiting times for patterns in sequences of random digits. J Appl Probab 21(4):730–737

3. Brémaud P. (1999) Markov chains. Gibbs fields, Monte Carlo simulation, and queues. 31., volume 31 of Texts in Applied Mathematics. Springer, New York

4. Chen R, Zame A (1979) On fair coin-tossing games. J Multivariate Anal 9 (1):150–156

5. De Santis E, Spizzichino F (2012) First occurrence of a word among the elements of a finite dictionary in random sequences of letters. Electron J Probab 17(25):9pp. (electronic)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Construction of aggregation paradoxes through load-sharing models;Advances in Applied Probability;2022-08-08

2. Taboo rate and hitting time distribution of continuous-time reversible Markov chains;Statistics & Probability Letters;2021-02

3. Stochastic Precedence and Minima Among Dependent Variables;Methodology and Computing in Applied Probability;2020-02-14

4. Usual and stochastic tail orders between hitting times for two Markov chains;Applied Stochastic Models in Business and Industry;2016-05-24