| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1153261 | Statistics & Probability Letters | 2008 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
Victor de la Pena, Henryk Gzyl, Patrick McDonald,