Some remarks on diffusion distances (Q1959405): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Diffusion maps, spectral clustering and reaction coordinates of dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel methods in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning: ECML 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of some formulas for finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the moments of Markov renewal processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses and their application to applied probability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660553 / rank
 
Normal rank

Revision as of 06:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Some remarks on diffusion distances
scientific article

    Statements

    Some remarks on diffusion distances (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    Summary: As a diffusion distance, we propose to use a metric (closely related to cosine similarity) which is defined as the \(L^{2}\) distance between two \(L^{2}\)-normalized vectors. We provide a mathematical explanation as to why the normalization makes diffusion distances more meaningful. Our proposal is in contrast to that made some years ago by R. Coifman which finds the \(L^{2}\) distance between certain \(L^{1}\) unit vectors. In the second part of the paper, we give two proofs that an extension of mean first passage time to mean first passage cost satisfies the triangle inequality; we do not assume that the underlying Markov matrix is diagonalizable. We conclude by exhibiting an interesting connection between the (normalized) mean first passage time and the discretized solution of a certain Dirichlet-Poisson problem and verify our result numerically for the simple case of the unit circle.
    0 references
    diffusion distances
    0 references
    mean first passage time
    0 references
    mean first passage cost
    0 references
    Dirichlet-Poisson problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references