The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem (Q3427459): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
20 March 2007
0 references
fast mixing
0 references
second smallest eigenvalue
0 references
semidefinite programming
0 references
dimensionality reduction
0 references
