Scenery reconstruction on finite abelian groups
From MaRDI portal
(Redirected from Publication:402726)
Abstract: We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient condition for reconstructibility on cycles. While, as we show, this condition is not in general necessary, our main result is that it is necessary when the length of the cycle is prime and larger than 5, and the step distribution has only rational probabilities. We extend this result to other abelian groups.
Recommendations
- A condition for distinguishing sceneries on non-abelian groups
- scientific article; zbMATH DE number 3846346
- scientific article; zbMATH DE number 4170971
- The Reconstructibility of Finite Abelian Groups
- Reconstruction of incidence geometries from groups of automorphisms
- Incidence-Geometric Aspects of Finite Abelian Groups
- Decomposing finite Abelian groups
- scientific article; zbMATH DE number 6139802
- Some geometric aspects of finite abelian groups
- scientific article; zbMATH DE number 6755760
Cites work
- Detecting defects in periodic scenery by random walks on Z
- Distinguishing certain random sceneries on \(\mathbb{Z}\) via random walks
- Distinguishing sceneries by observing the scenery along a random walk path
- scientific article; zbMATH DE number 1195778 (Why is no real title available?)
- Indistinguishable Sceneries
- Orthogonality of Measures Induced by Random Walks with Scenery
- Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps
- Reconstructing a piece of scenery with polynomially many observations.
- Reconstruction of periodic sceneries seen along a random walk
Cited in
(5)
This page was built for publication: Scenery reconstruction on finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402726)