Relative complexity of random walks in random sceneries
\([T, T^{-1}\)-transformation]Borodin theoremlocal timerandom walk in random sceneryrelative complexityrelative entropy dimensionrelative isomorphismsymmetric stable process
Dynamical aspects of measure-preserving transformations (37A05) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Central limit and other weak theorems (60F05) Functional limit theorems; invariance principles (60F17)
Let \({(X, \mathcal{B}, m, T)}\) be a probability preserving transformation and \(P\) be a \(T\)-generator. For \({n\geq1,\;\varepsilon>0}\) and a \(T\)-invariant sub-\(\sigma\)-algebra \(\mathcal{C}\subseteq\mathcal{B}\), the author define the following random variable \[ K_{\mathcal{C}}(P, n, \varepsilon):=\min\left\{\#F:\, F\subset X,\, m\left(\bigcup\limits_{z\in F}B(n, P, z, \varepsilon)\,||\,\mathcal{C}\right)>1-\varepsilon\right\}, \] where \[ {B(n, P, z, \varepsilon)=\bigcup_{a\in P_n:\, \overline{d}^{(P)}_n(a, P_n(z))\leq\varepsilon}a},\;P_n(z) \] is defined by \[ z\in P_n(z)\in {P_n=\bigvee_{j=0}^{n-1}T^{-j}P},\;\overline{d}^{(P)}_n \] is a Hamming metric on \(P_n,\) and \(m(\cdot||\,\mathcal{C})\) denotes conditional measure with respect to \(\mathcal{C}.\) Such a family of random variables is called the ``relative complexity'of \(T\) with respect to \(P\) given \(\mathcal{C}\). At the beginning of paper the author develop the theory of relative complexity also including such notions as ``\(\mathcal{C}\)-complexity sequence and ``relative entropy dimentions. These notions are relativized versions of those in [\textit{S. Ferenczi}, Isr. J. Math. 100, 189--207 (1997; Zbl 1095.28510); \textit{A. Katok} and \textit{J.-P. Thouvenot}, Ann. Inst. Henri Poincaré, Probab. Stat. 33, No. 3, 323--338 (1997; Zbl 0884.60009); \textit{S. Ferenczi} and \textit{K. K. Park}, Discrete Contin. Dyn. Syst. 17, No. 1, 133--141 (2007; Zbl 1128.37004)]. In the second part of paper, the author applies this theory to a concrete probability preserving transformation which is an \(\alpha\)-stable (\(\alpha\in (1,2]\)) random walk on ergodic random scenery. In particular, it is obtained invariants for relative isomorphism of these.
- Stability of properties of Kolmogorov complexity under relativization
- A Random Oracle Does Not Help Extract the Mutual Information
- Combinatorial foundations of information theory and the calculus of probabilities
- Binary sequences. I: Complexity
- Kolmogorov complexity and Hausdorff dimension
- On the distribution function of the complexity of finite sequences
- A note on Kolmogorov complexity and entropy
- A proof of the Beyer-Stein-Ulam relation between complexity and entropy
- Algorithmic relative complexity
- scientific article; zbMATH DE number 4054673
- \(T,T^{-1}\) transformation is not loosely Bernoulli
- A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space
- A limit theorem related to a new class of self similar processes
- Asymptotically Brownian skew products give non-loosely Bernoulli K- automorphisms
- Entropy and \(\sigma\)-algebra equivalence of certain random walks on random sceneries
- Entropy and dyadic equivalence of random walks on a random scenery
- Entropy dimensions and a class of constructive examples
- Ergodic theory and statistical mechanics
- scientific article; zbMATH DE number 3562192 (Why is no real title available?)
- scientific article; zbMATH DE number 3215022 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3065414 (Why is no real title available?)
- Local times for a class of Markoff processes
- Measure-theoretic complexity of ergodic systems
- Mixing properties of a class of skew-products
- On the Asymptotic Behavior of Local Times of Recurrent Random Walks with Finite Variance
- Predictability, entropy and information of infinite transformations
- Random walk in random scenery: A survey of some recent results
- Random Walks and A Sojourn Density Process of Brownian Motion
- Slow entropy type invariants and smooth realization of commuting measure-preserving transformations
- Sojourn times of diffusion processes
- The Asymptotic Behavior of Local Times of Recurrent Random Walks with Infinite Variance
- The Individual Ergodic Theorem of Information Theory
- The range of stable random walks
- Weak invariance principle for the local times of partial sums of Markov chains
- Scenery reconstruction for random walk on random scenery systems
- The boundary of the range of a random walk and the Følner property
- Weak invariance principle for the local times of partial sums of Markov chains
- Entropy and \(\sigma\)-algebra equivalence of certain random walks on random sceneries
- Relative complexity of random walks in random scenery in the absence of a weak invariance principle for the local times
- Efficient random walks in the presence of complex two-dimensional geometries
- Superpolynomial growth in the number of v_n names for random walks on random sceneries
- Entropy dimension for deterministic walks in random sceneries
- Packing topological entropy for amenable group actions
This page was built for publication: Relative complexity of random walks in random sceneries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693714)
