Inverse problems for random walks on trees: network tomography

Details Inverse problems for random walks on trees: network tomography Inverse problems for random walks on trees: network tomography

2006-10-27

arxiv.org/abs/math/0610821v1

Mathematics

Probability

11 pages, 1 figure

Scientific paper

Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear chains of length at least 2 to the terminal vertices of $G.$ Then $G^\prime$ admits distinguished boundary layers and the transition probabilities associated to the internal vertices of $G$ can be augmented to define a simple nondegenerate Markov chain $X$ on the vertices of $G^\prime.$ We show that the transition probabilities of $X$ can be recovered from the joint distribution of first hitting time and first hitting place of $X$ started at the root $r$ for the distinguished boundary layers of $G^\prime.$

Affiliated with

Also associated with

No associations

Rating

Inverse problems for random walks on trees: network tomography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inverse problems for random walks on trees: network tomography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inverse problems for random walks on trees: network tomography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169606