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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/s0036144504443821 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083412275 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

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
    0 references