Level-wise approximation of a Markov process associated to the boundary of an infinite tree
An approximation of a Markov process associated to the boundary of an infinite rooted tree is studied. This approximation is constructed by projecting the infinitesimal generator of the original process (defined on the boundary), onto the spaces associated to the filtration spanned by the successive levels of the rooted tree. The notions and the results used in the paper are mainly taken from \textit{C. Dellacherie, S. Martínez} and \textit{J. San Martín} [Adv. Appl. Math. 17, No.~2, 169--183 (1996; Zbl 0861.60077)].
- A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix
- scientific article; zbMATH DE number 3443951 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
- Random walks and percolation on trees
- Random walks, capacity and percolation on trees
- Ultrametric matrices and induced Markov chains
This page was built for publication: Level-wise approximation of a Markov process associated to the boundary of an infinite tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385607)