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

From MaRDI portal
Revision as of 17:06, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fast mixing
    0 references
    second smallest eigenvalue
    0 references
    semidefinite programming
    0 references
    dimensionality reduction
    0 references