Fastest mixing Markov chain problem for the union of two cliques (Q3090727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5944692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fastest mixing Markov chain problem for the union of two cliques |
scientific article; zbMATH DE number 5944692 |
Statements
Fastest mixing Markov chain problem for the union of two cliques (English)
0 references
1 September 2011
0 references
fastest mixing
0 references
Markov chain
0 references
subdominant eigenvalues
0 references
second largest eigenvalue modulus
0 references
random walk
0 references
0 references
0.8861892
0 references
0.88162595
0 references
0.86858326
0 references
0 references
0.8623171
0 references
0 references
0.8515506
0 references
0.8490671
0 references
0.84554076
0 references
