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

Dellacherie C.; Martínez, S.; Martin, JS

Abstract

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 P-t, and the couples i not equal j for which P-ij > 0 (equivalently (U-1)(ij) < 0). (C) 2000 Elsevier Science Inc. All rights reserved.

Más información

Título según WOS: Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
Título según SCOPUS: Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
Título de la Revista: LINEAR ALGEBRA AND ITS APPLICATIONS
Volumen: 318
Número: 1-3
Editorial: Elsevier Science Inc.
Fecha de publicación: 2000
Página de inicio: 1
Página final: 21
Idioma: English
URL: http://linkinghub.elsevier.com/retrieve/pii/S0024379500001932
DOI:

10.1016/S0024-3795(00)00193-2

Notas: ISI, SCOPUS