Inverse problems for random walks on trees: network tomography

Publication date 10 December 2008

Abstract: 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^{p} r i m e

constructed by gluing finite linear chains of length at least 2 to the terminal vertices of

G .

Then

G^{p} r i m e

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^{p} r i m e .

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^{p} r i m e .

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Inverse problems for random walks on trees: network tomography