A Strong Law of Large Numbers for Strongly Mixing Processes

DOI10.1080/03610926.2012.701696zbMath1301.60031arXiv0807.4665OpenAlexW2055646364MaRDI QIDQ2931574

No author found.

Publication date: 26 November 2014

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.4665

zbMATH Keywords

Markov chain Monte Carlolaw of large numbersmixingconcentration

Mathematics Subject Classification ID

Strong limit theorems (60F15) Signal detection and filtering (aspects of stochastic processes) (60G35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• On adaptive Markov chain Monte Carlo algorithms
• On the ergodicity properties of some adaptive MCMC algorithms
• Constructing processes with prescribed mixing coefficients
• Basic properties of strong mixing conditions. A survey and some open questions
• Measure concentration for a class of random processes
• A new weak dependence condition and applications to moment inequalities
• A note on uniform laws of averages for dependent processes
• Concentration of measure inequalities for Markov chains and \(\Phi\)-mixing processes.
• Transportation cost-information inequalities and applications to random dynamical systems and diffusions.
• A counterexample concerning uniform ergodic theorems for a class of functions
• Weighted sums of certain dependent random variables
• Strong laws of large numbers under weak assumptions with application
• The Strong Law of Large Numbers for a Class of Markov Chains
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• An adaptive Metropolis algorithm