Ultrametric matrices and induced Markov chains (Q1922544)

From MaRDI portal
Revision as of 19:10, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Ultrametric matrices and induced Markov chains
scientific article

    Statements

    Ultrametric matrices and induced Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    12 May 1997
    0 references
    Let \(I\) be a finite set. A nonnegative symmetric matrix \((A_{ij})_{i,j\in I}\) is ultrametric if \(A_{ij}\geq \min\{A_{ik},A_{kj}\}\) for all \(i,j,k\in I\). Such matrices are proportional to the potential function \(\sum^\infty_{k=0} P^k\) of some substochastic matrix \(P\) which, in turn, defines a graph \(G^A=\{(i,j): P_{ij}>0\}\). The paper mainly deals with the analysis of \(G^A\) and its restriction to the set of `roots' \(R=\{i\in I:\sum_{j\in I}P_{ij}<1\}\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    ultrametric matrices
    0 references
    Markov chains
    0 references
    substochastic kernels
    0 references
    tree matrices
    0 references
    0 references