Reconstructing Markov processes from independent and anonymous experiments
Name
Silvio_Reconstructing Markov .pdf
Size
813.78 KB
Format
Adobe PDF
Checksum (MD5)
8a977c924964a3d9b9c552523f9d105f
Author(s)
Micali, Silvio
Zhu, Zeyuan Allen
Date Issued
February 2016
Journal
Discrete Applied Mathematics
Publisher
Elsevier BV
Citation
Micali, Silvio et al. “Reconstructing Markov Processes from Independent and Anonymous Experiments.” Discrete Applied Mathematics 200 (February 2016): 108–122 © 2015 Elsevier B.V.
Version
Author's final manuscript
Abstract
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
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.DAM.2015.06.035
