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.
Year of publication: |
2008
|
---|---|
Authors: | de la Pena, Victor ; Gzyl, Henryk ; McDonald, Patrick |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 78.2008, 18, p. 3176-3183
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
International Diversification: An Extreme Value Approach
Chollete, Loran, (2009)
-
The Sword and the Coffers : The Fiscal Foundations of Sustainable Peace
Chapman, Terrence, (2010)
-
Renold, Ursula, (2024)
- More ...