Showing 1 - 1 of 1
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 reconstructability on cycles. While, as we...
Persistent link: https://www.econbiz.de/10010875069