2000 character limit reached
On some possible combinations of mixing rates for strictly stationary, reversible Markov chains
Published 1 Oct 2022 in math.PR | (2210.00355v1)
Abstract: A class of examples is constructed to show that for strictly stationary Markov chains that are reversible, the simultaneous mixing rates for the $\rho$-mixing and strong mixing ($\alpha$-mixing) conditions can be fairly arbitrary, within certain unavoidable tight restrictions. The examples constructed here have the added property that the mixing rate for the absolute regularity ($\beta$-mixing) condition is within a constant factor of that for strong mixing.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.