Fastest mixing Markov chain problem for the union of two cliques (Q3090727)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fastest mixing Markov chain problem for the union of two cliques
scientific article

    Statements

    Fastest mixing Markov chain problem for the union of two cliques (English)
    0 references
    0 references
    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

    Identifiers