Reconstructing Markov processes from independent and anonymous experiments
Author(s)Micali, Silvio; Zhu, Zeyuan Allen
MetadataShow full item record
We investigate the problem of exactly reconstructing, with high confidence and up to isomorphism, the ball of radius r centered at the starting state of a Markov process from independent and anonymous experiments. In an anonymous experiment, the states are visited according to the underlying transition probabilities, but no global state names are known: one can only recognize whether two states, reached within the same experiment, are the same. We prove quite tight bounds for such exact reconstruction in terms of both the number of experiments and their lengths. Keywords: Graph reconstruction; Random walk; Markov process; Local algorithms
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Discrete Applied Mathematics
Micali, Silvio et al. “Reconstructing Markov Processes from Independent and Anonymous Experiments.” Discrete Applied Mathematics 200 (February 2016): 108–122 © 2015 Elsevier B.V.
Author's final manuscript