Spatial mixing and the connective constant: optimal bounds (Q2359740): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Daniel Štefanković / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q1810165 / rank
Normal rank
 
Property / author
 
Property / author: Daniel Štefanković / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Nasir N. Ganikhodjaev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3135924815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for the Connective Constant of Self-Avoiding Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hard-hexagon model and Rogers—Ramanujan type identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact thresholds for Ising-Gibbs samplers on general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Markov Chains for Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: MCMC sampling colourings and independent sets of <i>G</i>(<i>n, d</i>/<i>n</i>) near uniqueness threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved inapproximability results for counting independent sets in the hard-core model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934720 / 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: Gibbs measures and phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and walks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of two‐state spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Spatial Mixing with Fewer Colors for Lattice Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5827372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of self-avoiding walks on the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matchings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Self-Avoiding Walks. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting via Correlation Decay in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Decay up to Uniqueness in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ising model and percolation on trees and tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and percolation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid mixing of Gibbs sampling on graphs that are sparse on average / 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: Robust phase transitions for Heisenberg and other models on general trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved mixing condition on the grid for counting and sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting in two-spin models on \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Glauber dynamics for sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:05, 14 July 2024

scientific article
Language Label Description Also known as
English
Spatial mixing and the connective constant: optimal bounds
scientific article

    Statements

    Spatial mixing and the connective constant: optimal bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2017
    0 references
    The authors consider the problem of evaluating the partition functions of the monomer-dimer model and the hard core model. The connective constant is a natural measure of the average degree of a graph. The best possible rates of decay of correlations in the natural probability distributions induced by both the hard core and the monomer-dimer model in graphs with a given bound on the connective constant are proved.
    0 references
    connective constant
    0 references
    monomer-dimer model
    0 references
    hard core model
    0 references
    spatial mixing
    0 references
    0 references
    0 references
    0 references
    0 references
    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