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

We supply a simple algorithm which describes the sub-Markov kernel P associated to a nonsingular generalized ultrametric matrix U. This algorithm is based on the dyadic tree structure of U, it identifies the exiting roots of P and Pt, and the couples i≠j for which Pij>0 (equivalently (U−1)ij<0).