Scenery reconstruction for random walk on random scenery systems
From MaRDI portal
Publication:2142707
DOI10.1007/s11856-022-2301-yzbMath1503.37054arXiv1909.07470OpenAlexW2974906950MaRDI QIDQ2142707
Publication date: 27 May 2022
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07470
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17) Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(T,T^{-1}\) transformation is not loosely Bernoulli
- Relative complexity of random walks in random sceneries
- Information recovery from randomly mixed-up message text
- Asymptotically Brownian skew products give non-loosely Bernoulli K- automorphisms
- Ergodic properties of color records
- Mixing properties of a class of skew-products
- Mixing properties of the generalized \(T,T^{-1}\)-process
- Reconstructing a random scenery observed with random errors along a random walk path
- Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps
- Scenery reconstruction in two dimensions with many colors
- Retrieving random media
- An example of a Kolmogorov automorphism that is not a Bernoulli shift
- Distinguishing sceneries by observing the scenery along a random walk path
- Reconstructing a piece of scenery with polynomially many observations.
- Indistinguishable Sceneries
- Random walk in random scenery: A survey of some recent results
- Probability Inequalities for Sums of Bounded Random Variables
- The isomorphism problem in ergodic theory
