2014
DOI: 10.1051/ps/2013052
|View full text |Cite
|
Sign up to set email alerts
|

On dependence structure of copula-based Markov chains

Abstract: We consider dependence coefficients for stationary Markov chains. We emphasize on some equivalencies for reversible Markov chains. We improve some known results and provide a necessary condition for Markov chains based on Archimedean copulas to be exponential ρ-mixing. We analyse the example of the Mardia and Frechet copula families using small sets.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
21
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(22 citation statements)
references
References 15 publications
1
21
0
Order By: Relevance
“…Hence the label ‘2 spectral gap’ for condition (R1) in Theorem 3.3. (cf. also Longla (2014, proof of Lemma 2.1)) Since the operator T 0 is self‐adjoint, it satisfies T0n=T0n for every positive integer n by a theorem in functional analysis. Also, as a consequence of (again) (2.6), it satisfies T0m=ρX(m) for every positive integer m .…”
Section: Strictly Stationary Reversible Markov Chainsmentioning
confidence: 98%
See 4 more Smart Citations
“…Hence the label ‘2 spectral gap’ for condition (R1) in Theorem 3.3. (cf. also Longla (2014, proof of Lemma 2.1)) Since the operator T 0 is self‐adjoint, it satisfies T0n=T0n for every positive integer n by a theorem in functional analysis. Also, as a consequence of (again) (2.6), it satisfies T0m=ρX(m) for every positive integer m .…”
Section: Strictly Stationary Reversible Markov Chainsmentioning
confidence: 98%
“…Proposition Under the hypothesis (the entire first paragraph, including reversibility ) of Theorem 3.3, the following three statements hold: In the notations of Theorem 3.3, if condition (A2) holds, then condition (R1) (the 2 spectral gap condition) holds. (cf. Longla (2014, Lemma 2.1)). Regardless of the value (in [0, 1]) of ρX(1), one has that for every n, ρX(n)=[ρX(1)]n. In the notations of Theorem 3.3, if condition (A3) holds, then condition (A2) holds. …”
Section: Strictly Stationary Reversible Markov Chainsmentioning
confidence: 99%
See 3 more Smart Citations