Level-wise approximation of a Markov process associated to the boundary of an infinite tree
From MaRDI portal
Publication:2385607
DOI10.1007/s10959-007-0073-2zbMath1132.60055MaRDI QIDQ2385607
Servet Martínez, Jaime San Martín, Daniel Remenik
Publication date: 12 October 2007
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10959-007-0073-2
potential theory; approximation; Markov process; infinite tree; boundary process; ultrametricity; ultrametric matrix; tree matrix; green kernel
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60H40: White noise theory
35R60: PDEs with randomness, stochastic partial differential equations
Related Items
Cites Work
- Random walks and percolation on trees
- Random walks, capacity and percolation on trees
- Ultrametric matrices and induced Markov chains
- Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
- A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix
- Unnamed Item
- Unnamed Item