Level-wise approximation of a Markov process associated to the boundary of an infinite tree

DOI10.1007/S10959-007-0073-2zbMATH Open1132.60055OpenAlexW2089133405MaRDI QIDQ2385607FDOQ2385607

Servet Martínez, Daniel Remenik, Jaime San Martín

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 2128189
• Construction of a Markov field on an infinite tree
• Approximating Markov processes through filtration
• Markov chains indexed by trees

zbMATH Keywords

Markov processapproximationpotential theoryboundary processultrametricityultrametric matrixinfinite treetree matrixgreen kernel

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) PDEs with randomness, stochastic partial differential equations (35R60) White noise theory (60H40)

Cites Work

• Title not available (Why is that?)
• Random walks, capacity and percolation on trees
• Ultrametric matrices and induced Markov chains
• Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
• Title not available (Why is that?)
• Random walks and percolation on trees
• A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix

Cited In (3)

• Ultrametric and tree potential
• Title not available (Why is that?)
• Convergences and projection Markov property of Markov processes on ultrametric spaces

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)