Inverse problems for random walks on trees: Network tomography

We solve a natural inverse problem for transition probabilities for Markov chains on rooted trees using hitting time distribution for leaves. Our solution is algorithmic and the natural statistics associated to our algorithm are consistent.