Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics - MaRDI portal

A power law of order 1/4 for critical mean field Swendsen-Wang dynamics (Q2925658)

From MaRDI portal





scientific article; zbMATH DE number 6357634
Language Label Description Also known as
English
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
scientific article; zbMATH DE number 6357634

    Statements

    0 references
    0 references
    0 references
    0 references
    17 October 2014
    0 references
    Markov chains
    0 references
    mixing time
    0 references
    Ising model
    0 references
    Swendsen-Wang algorithm
    0 references
    math.PR
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    A power law of order 1/4 for critical mean field Swendsen-Wang dynamics (English)
    0 references
    Let a Swendsen-Wan Markov chain be given, defined on a complete graph on \(n\) vertices, and with percolation parametric \(cn^{-1}\), where \(c\) is a constant parameter independent of time. Then the mixing time of such a process is \(T=\Theta(\log\, n)\), when \(c>2\), \(T=\Theta {n^{1/4}}\), when \(c=2\), and \(T=\Theta (1)\), when \(c<2\). The proof of this result is lengthy and involves several estimates about percolation on a complete graph, and random graph estimates.
    0 references
    0 references

    Identifiers