A stationary rho-mixing Markov chain which is not ``interlaced'' rho-mixing (Q5952039): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1017545123473 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W197206222 / rank | |||
Normal rank |
Latest revision as of 11:01, 30 July 2024
scientific article; zbMATH DE number 1687608
Language | Label | Description | Also known as |
---|---|---|---|
English | A stationary rho-mixing Markov chain which is not ``interlaced'' rho-mixing |
scientific article; zbMATH DE number 1687608 |
Statements
A stationary rho-mixing Markov chain which is not ``interlaced'' rho-mixing (English)
0 references
23 October 2002
0 references
Let \(X= \{X_k, k\in \mathbb{Z}\}\) be a sequence of random variables defined on a probability space \((\Omega,{\mathcal F},P)\), \[ \rho(X,n)= \sup_{j\in\mathbb{Z}} \rho(\sigma(X_k, k\leq j), \sigma(X_k, k\geq j+ n)), \] \[ \rho^*(X, n)= \sup\rho(\sigma(X_k, k\in S), \sigma(X_k, k\in T)), \] where this latter supremum is taken over all pairs of nonempty, disjoint sets \(S\) and \(T\subset\mathbb{Z}\) such that \(\inf_{s\in S,t\in T}|s-t|\geq n\) and for any two \(\sigma\)-fields \({\mathcal A}\) and \({\mathcal B}\subset{\mathcal F}\), \(\rho({\mathcal A},{\mathcal B})= \sup|\text{Corr}(f,g)|\), where the supremum is taken over all pairs of square-integrable random variables \(f\) and \(g\) such that \(f\) is \({\mathcal A}\)-measurable and \(g\) is \({\mathcal B}\)-measurable. It is proved that for any sequence of positive numbers \(\{c_n, n\geq 1\}\) there exists a strictly stationary, countable-state Markov chain \(X= \{X_k, k\in \mathbb{Z}\}\) such that \(\rho(X,n)\leq c_n\) for all \(n\geq 1\) and \(\rho^*(X,n)\equiv 1\).
0 references
Markov chain
0 references
\(\rho\)-mixing
0 references
\(\rho^*\)-mixing
0 references