The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem (Q3427459)

From MaRDI portal
Revision as of 19:44, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
scientific article

    Statements

    The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem (English)
    0 references
    0 references
    20 March 2007
    0 references
    fast mixing
    0 references
    second smallest eigenvalue
    0 references
    semidefinite programming
    0 references
    dimensionality reduction
    0 references

    Identifiers

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