С. С. Самарова, “О длине максимальной серии «успехов» для марковской цепи с двумя состояниями”, Теория вероятн. и ее примен., 26:3 (1981), 510–520; Theory Probab. Appl., 26:3 (1982), 498

Цитирование в формате AMSBIB

\RBibitem{Sam81}

\by С.~С.~Самарова

\paper О длине максимальной серии <<успехов>> для марковской цепи с двумя состояниями

\jour Теория вероятн. и ее примен.

\yr 1981

\vol 26

\issue 3

\pages 510--520

\mathnet{http://mi.mathnet.ru/tvp2586}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=627858}

\zmath{https://zbmath.org/?q=an:0487.60061|0466.60065}

\transl

\jour Theory Probab. Appl.

\yr 1982

\vol 26

\issue 3

\pages 498--509

\crossref{https://doi.org/10.1137/1126056}

\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=A1981PA76400005}

Эта публикация цитируется в следующих 22 статьяx:

Chen Xu Hao, Ting Ma, “Limiting Behaviors for Longest Consecutive Switches in an IID Bernoulli Sequence”, Acta. Math. Sin.-English Ser., 39:6 (2023), 1138
Yizhou Xia, “On longest consecutive patterns in Markov chains”, Stochastics, 94:8 (2022), 1221
Haibo Chen, Daoxin Ding, Xinghuo Long, “The Hausdorff dimension of level sets described by Erdös–Rényi average”, Journal of Mathematical Analysis and Applications, 458:1 (2018), 464
Yazhe Zhang, “Binomial approximation for sum of indicators with dependent neighborhoods”, Statistics & Probability Letters, 119 (2016), 146
Ya Zhe Zhang, Xian Yuan Wu, “Some results associated with the longest run in a strongly ergodic Markov chain”, Acta. Math. Sin.-English Ser., 29:10 (2013), 1939
В. А. Барвинок, В. И. Богданович, А. Н. Плотников, “К вопросу о предельном распределении серий в случайной двоичной последовательности”, Вестн. Сам. гос. техн. ун-та. Сер. Физ.-мат. науки, 4(29) (2012), 56–71
Peggy Cénac, Brigitte Chauvin, Stéphane Ginouillac, Nicolas Pouyanne, “Digital search trees and chaos game representation”, ESAIM: PS, 13 (2009), 15
Eutichia Vaggelatou, “On the length of the longest run in a multi-state Markov chain”, Statistics & Probability Letters, 62:3 (2003), 211
Wiley Series in Probability and Statistics, Runs and Scans with Applications, 2001, 389
Sophie Schbath, “An Overview on the Distribution of Word Counts in Markov Chains”, Journal of Computational Biology, 7:1-2 (2000), 193
В. В. Вьюгин, “О длине максимальной серии “успехов” в индивидуальной случайной последовательности”, Теория вероятн. и ее примен., 42:3 (1997), 608–615 ; V. V. V'yugin, “On the longest head-run in an individual random sequence”, Theory Probab. Appl., 42:3 (1998), 541–546
С. Ю. Новак, “О распределении максимума частичных сумм Эрдеша–Реньи”, Теория вероятн. и ее примен., 42:2 (1997), 274–293 ; S. Yu. Novak, “On the Erdös–Rényi maximum of partial sums”, Theory Probab. Appl., 42:2 (1998), 254–270
K. Binswanger, P. Embrechts, “Longest runs in coin tossing”, Insurance: Mathematics and Economics, 15:2-3 (1994), 139
Francis M. Comets, “Erdős-Rényi laws for Gibbs measures”, Commun.Math. Phys., 162:2 (1994), 353
Macdonald Morris, Gabriel Schachtel, Samuel Karlin, “Exact Formulas for Multitype Run Statistics in a Random Ordering”, SIAM J. Discrete Math., 6:1 (1993), 70
Anant P. Godbole, “Poisson approximations for runs and patterns of rare events”, Advances in Applied Probability, 23:4 (1991), 851
O. Chrysaphinou, S. Papastavridis, “The occurrence of sequence patterns in repeated dependent experiments”, Теория вероятн. и ее примен., 35:1 (1990), 167–173 ; O. Chrysaphinou, S. Papastavridis, “The occurrence of sequence patterns in repeated dependent experiments”, Theory Probab. Appl., 35:1 (1990), 145–152
O. Chrysaphinou, S. Papastavridis, “A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials”, Probab. Th. Rel. Fields, 79:1 (1988), 129
O. Chryssaphinou, S. Papastavridis, “A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials”, Journal of Applied Probability, 25:2 (1988), 428
Samuel Karlin, Friedemann Ost, “Counts of long aligned word matches among random letter sequences”, Advances in Applied Probability, 19:2 (1987), 293