Remarks on the speed of convergence of mixing coefficients and applications (1210.5673v2)
Abstract: In this paper, we study dependence coefficients for copula-based Markov chains. We provide new tools to check the convergence rates of mixing coefficients of copula-based Markov chains. We study Markov chains generated by the Metropolis-hastings algorithm and give conditions on the proposal that ensure exponential $\rho$-mixing, $\beta$-mixing and $\phi$-mixing. A general necessary condition on symmetric copulas to generate exponential $\rho$-mixing or $\phi$-mixing is given. At the end of the paper, we comment and improve some of our previous results on mixtures of copulas.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.