Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bolthausen, E.
1980.
The Berry-Esseen theorem for functionals of discrete Markov chains.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 54,
Issue. 1,
p.
59.
Pitman, J. W.
1981.
Seminar on Stochastic Processes, 1981.
p.
79.
Bolthausen, E.
1982.
The Berry-Esse�n theorem for strongly mixing Harris recurrent Markov chains.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 60,
Issue. 3,
p.
283.
Benevento, Rodolfo V.
1984.
The occurrence of sequence patterns in ergodic Markov chains.
Stochastic Processes and their Applications,
Vol. 17,
Issue. 2,
p.
369.
Shiffrin, Richard
and
Thompson, Maynard
1988.
Moments of transition-additive random variables defined on finite, regenerative random processes.
Journal of Mathematical Psychology,
Vol. 32,
Issue. 3,
p.
313.
Aldous, David
1989.
Hitting times for random walks on vertex-transitive graphs.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 106,
Issue. 1,
p.
179.
Malinovskii, Vsevolod K.
1994.
Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach.
Acta Applicandae Mathematicae,
Vol. 34,
Issue. 1-2,
p.
261.
Silvestrov, Dmitrii S.
1996.
Recurrence relations for generalized hitting times for semi-Markov processes.
The Annals of Applied Probability,
Vol. 6,
Issue. 2,
Aldous, David
Lovász, László
and
Winkler, Peter
1997.
Mixing times for uniformly ergodic Markov chains.
Stochastic Processes and their Applications,
Vol. 71,
Issue. 2,
p.
165.
Fuh, C. D.
1997.
Corrected Diffusion Approximations for Ruin Probabilities in a Markov Random Walk.
Advances in Applied Probability,
Vol. 29,
Issue. 3,
p.
695.
Fitzsimmons, P.J.
and
Pitman, Jim
1999.
Kac’s moment formula and the Feynman–Kac formula for additive functionals of a Markov process.
Stochastic Processes and their Applications,
Vol. 79,
Issue. 1,
p.
117.
Borkar, Vivek S.
Ejov, Vladimir
and
Filar, Jerzy A.
2004.
Directed graphs, Hamiltonicity and doubly stochastic matrices.
Random Structures & Algorithms,
Vol. 25,
Issue. 4,
p.
376.
Obłój, Jan
2004.
The Skorokhod embedding problem and its offspring.
Probability Surveys,
Vol. 1,
Issue. none,
Beveridge, Andrew
2009.
Centers for Random Walks on Trees.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 1,
p.
300.
BEVERIDGE, ANDREW
and
LOVÁSZ, LÁSZLÓ
2010.
Exit Frequency Matrices for Finite Markov Chains.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 4,
p.
541.
Gómez-Corral, A.
and
López García, M.
2012.
Extinction times and size of the surviving species in a two-species competition process.
Journal of Mathematical Biology,
Vol. 64,
Issue. 1-2,
p.
255.
Beveridge, Andrew
and
Wang, Meng
2013.
Exact Mixing Times for Random Walks on Trees.
Graphs and Combinatorics,
Vol. 29,
Issue. 4,
p.
757.
Mikosch, Thomas
and
Wintenberger, Olivier
2013.
Precise large deviations for dependent regularly varying sequences.
Probability Theory and Related Fields,
Vol. 156,
Issue. 3-4,
p.
851.
Mikosch, Thomas
and
Wintenberger, Olivier
2014.
The cluster index of regularly varying sequences with applications to limit theory for functions of multivariate Markov chains.
Probability Theory and Related Fields,
Vol. 159,
Issue. 1-2,
p.
157.
Pitman, Jim
and
Tang, Wenpin
2018.
Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain.
Bernoulli,
Vol. 24,
Issue. 3,