Inverse problems for random walks on trees: Network tomography

Victor de la Pena, Henryk Gzyl () and Patrick McDonald

Statistics & Probability Letters, 2008, vol. 78, issue 18, 3176-3183

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.

Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(08)00288-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:78:y:2008:i:18:p:3176-3183

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().