Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517): Difference between revisions

From MaRDI portal
Merged Item from Q3549644
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reconstruction for Colorings on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic scan for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring graphs with lower bounds on girth and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring sparse random graphs with fewer colors than the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring constant degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing in time and space for lattice spin systems: A combinatorial view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing time of Glauber dynamics for coloring regular trees / 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 general lower bound for mixing of single-site dynamics on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling with the stationary distribution and improved sampling for colorings and independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / 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: Uniqueness of uniform random colorings of regular trees / 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: The Glauber Dynamics for Colorings of Bounded Degree Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast mixing for independent sets, colorings, and other models on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs rapidly samples colorings of \(G(n, d/n)\) / 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: Reconstruction of random colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transition for the mixing time of the Glauber dynamics for coloring regular trees / rank
 
Normal rank

Latest revision as of 06:56, 11 July 2024

scientific article; zbMATH DE number 5485480
Language Label Description Also known as
English
Randomly coloring planar graphs with fewer colors than the maximum degree
scientific article; zbMATH DE number 5485480

    Statements

    Randomly coloring planar graphs with fewer colors than the maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2016
    0 references
    5 January 2009
    0 references
    Markov chain Monte Carlo
    0 references
    random colorings
    0 references
    approximate counting
    0 references
    Glauber dynamics
    0 references
    mixing time
    0 references
    random sampling
    0 references
    \(k\)-colorings
    0 references
    Markov chains
    0 references
    frozen vertices
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references