Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
