Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach

DOI10.1016/S0024-3795(00)00193-2zbMath0967.65054WikidataQ127372853 ScholiaQ127372853MaRDI QIDQ1590642

Claude Dellacherie, Servet Martínez, Jaime San Martín

Publication date: 21 August 2001

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmMarkov kernelM-matrixultrametric matrix

Mathematics Subject Classification ID

Related Items (9)

Resistance distances on networks ⋮ Potentials of random walks on trees ⋮ Boundary Value Problems on Finite Networks ⋮ A Class ofM-matrices whose Graphs are Trees ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ Duality and intertwining for discrete Markov kernels: relations and examples ⋮ On polymorphism for discrete evolutionary dynamics driven either by selection or segregation distortion ⋮ Characterization of symmetric \(M\)-matrices as resistive inverses ⋮ A Note on Ultrametric Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential kernels associated to a filtration
• Inverse \(M\)-matrix inequalities and generalized ultrametric matrices
• Generalized ultrametric matrices -- a class of inverse \(M\)-matrices
• On classes of inverse \(Z\)-matrices
• 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
• Nonnegative Matrices whose Inverses are M-Matrices
• Diagonally dominant matrices

This page was built for publication: Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach