Displaying similar documents to “A Markov process underlying the generalized Syracuse algorithm”

Simple Markov chains

O. Adelman (1976)

Annales scientifiques de l'Université de Clermont. Mathématiques

Similarity:

Bounds on regeneration times and limit theorems for subgeometric Markov chains

Randal Douc, Arnaud Guillin, Eric Moulines (2008)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

This paper studies limit theorems for Markov chains with general state space under conditions which imply subgeometric ergodicity. We obtain a central limit theorem and moderate deviation principles for additive not necessarily bounded functional of the Markov chains under drift and minorization conditions which are weaker than the Foster–Lyapunov conditions. The regeneration-split chain method and a precise control of the modulated moment of the hitting time to small sets are employed...

On the exchanges between Wolfgang Doeblin and Bohuslav Hostinský

Laurent Mazliak (2007)

Revue d'histoire des mathématiques

Similarity:

We present the letters sent by Wolfgang Doeblin to Bohuslav Hostinský between 1936 and 1938. They concern some aspects of the general theory of Markov chains and the solutions of the Chapman-Kolmogorov equation that Doeblin was then establishing for his PhD thesis.