Systematic scan for sampling colorings (Q2494577): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56323916, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Martin Dyer / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Utkir A. Rozikov / rank
Normal rank
 
Property / author
 
Property / author: Martin Dyer / rank
 
Normal rank
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Utkir A. Rozikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014487253 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0603323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for Reversible Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the Gibbs sampler for perturbations of Gaussians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times of the biased card shuffling and the asymmetric exclusion process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Markov Chains for Randomly H-Coloring a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric bounds for eigenvalues of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chain comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate selection rules for Gibbs sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent Statistics of the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of 3‐colorings in ℤ<sup>2</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chain Algorithms for Planar Lattice Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times of lozenge tiling and card shuffling Markov chains / rank
 
Normal rank

Latest revision as of 16:33, 24 June 2024

scientific article
Language Label Description Also known as
English
Systematic scan for sampling colorings
scientific article

    Statements

    Systematic scan for sampling colorings (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2006
    0 references
    The systematic scan for some spin system is studied. The most part of the paper is devoted to proper \(q\)-colorings of a path of \(n\) vertices (the one-dimensional \(q\)-state Potts model at zero temperature). Tight (i.e., matching within a constant factor) upper and lower bounds on mixing time are provided. Measuring mixing time in terms of the number of updates of individual vertices (so that one scan equal to \(n\) updates), the authors show that when \(q=3,\) mixing occurs in \(\Theta(n^3\log n)\) updates, whether Glauber dynamics or systematic scan is used; while when \(q\geq 4\), mixing occurs in \(\Theta(n\log n)\) updates, again independently of whether Glauber or scan is used. Also for ``\(H\)-colorings'' model arbitrary spin systems with symmetric ``hard'' constraints it is shown that for any \(H\), Glauber mixes in \(O(n^5)\) updates and scan in \(O(n^6)\) updates.
    0 references
    Glauber dynamics
    0 references
    graph homomorphisms
    0 references
    mixing time
    0 references
    Potts model
    0 references
    spin systems
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references