Counting in two-spin models on \(d\)-regular graphs (Q471149): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1203.2602 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / rank
 
Normal rank
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / qualifier
 
Similarity Score: 0.8633113
Amount0.8633113
Unit1
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / qualifier
 
Property / Recommended article
 
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / rank
 
Normal rank
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / qualifier
 
Similarity Score: 0.8558281
Amount0.8558281
Unit1
Property / Recommended article: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / qualifier
 
Property / Recommended article
 
Property / Recommended article: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / Recommended article: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / qualifier
 
Similarity Score: 0.84793085
Amount0.84793085
Unit1
Property / Recommended article: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Approximating the partition function of planar two-state spin systems / rank
 
Normal rank
Property / Recommended article: Approximating the partition function of planar two-state spin systems / qualifier
 
Similarity Score: 0.83795714
Amount0.83795714
Unit1
Property / Recommended article: Approximating the partition function of planar two-state spin systems / qualifier
 
Property / Recommended article
 
Property / Recommended article: The computational complexity of two‐state spin systems / rank
 
Normal rank
Property / Recommended article: The computational complexity of two‐state spin systems / qualifier
 
Similarity Score: 0.8353896
Amount0.8353896
Unit1
Property / Recommended article: The computational complexity of two‐state spin systems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region / rank
 
Normal rank
Property / Recommended article: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region / qualifier
 
Similarity Score: 0.82823193
Amount0.82823193
Unit1
Property / Recommended article: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region / qualifier
 
Property / Recommended article
 
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / rank
 
Normal rank
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / qualifier
 
Similarity Score: 0.8247887
Amount0.8247887
Unit1
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / qualifier
 
Property / Recommended article
 
Property / Recommended article: Algorithms for #BIS-Hard Problems on Expander Graphs / rank
 
Normal rank
Property / Recommended article: Algorithms for #BIS-Hard Problems on Expander Graphs / qualifier
 
Similarity Score: 0.8225274
Amount0.8225274
Unit1
Property / Recommended article: Algorithms for #BIS-Hard Problems on Expander Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Fast Algorithms for General Spin Systems on Bipartite Expanders / rank
 
Normal rank
Property / Recommended article: Fast Algorithms for General Spin Systems on Bipartite Expanders / qualifier
 
Similarity Score: 0.81966496
Amount0.81966496
Unit1
Property / Recommended article: Fast Algorithms for General Spin Systems on Bipartite Expanders / qualifier
 
Property / Recommended article
 
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / rank
 
Normal rank
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / qualifier
 
Similarity Score: 0.81784624
Amount0.81784624
Unit1
Property / Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model / qualifier
 

Latest revision as of 18:52, 27 January 2025

scientific article
Language Label Description Also known as
English
Counting in two-spin models on \(d\)-regular graphs
scientific article

    Statements

    Counting in two-spin models on \(d\)-regular graphs (English)
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    two-spin models
    0 references
    \(d\)-regular graphs
    0 references
    independent sets
    0 references
    anti-ferromagnetic Ising model
    0 references
    locally tree-like graphs
    0 references
    hard-core model
    0 references
    Bethe free energy
    0 references
    Gibbs uniqueness threshold
    0 references

    Identifiers

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