General state space Markov chains and MCMC algorithms.
Roberts, Gareth O., Rosenthal, Jeffrey S. (2004)
Probability Surveys [electronic only]
Similarity:
Roberts, Gareth O., Rosenthal, Jeffrey S. (2004)
Probability Surveys [electronic only]
Similarity:
Chazottes, Jean-René, Giardina, Cristian, Redig, Frank (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Fitzsimmons, Patrick J. (2006)
Electronic Communications in Probability [electronic only]
Similarity:
Geon Choe, Dong Kim (2000)
Colloquium Mathematicae
Similarity:
The convergence rate of the expectation of the logarithm of the first return time , after being properly normalized, is investigated for ergodic Markov chains. I. Kontoyiannis showed that for any β > 0 we have a.s. for aperiodic cases and A. J. Wyner proved that for any ε >0 we have eventually, a.s., where is the probability of the initial n-block in x. In this paper we prove that converges to a constant depending only on the process where is the modified first return...
Bednorz, Witold, Latuszynski, Krzysztof, Latala, Rafal (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Giacomin, Giambattista (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Takeda, Masayoshi (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Anja Voss-Böhme (2011)
Kybernetika
Similarity:
For general interacting particle systems in the sense of Liggett, it is proven that the class of cylinder functions forms a core for the associated Markov generator. It is argued that this result cannot be concluded by straightforwardly generalizing the standard proof technique that is applied when constructing interacting particle systems from their Markov pregenerators.
Chigansky, Pavel, Liptser, Robert (2006)
Electronic Communications in Probability [electronic only]
Similarity: