Image de couverture de livre

Critical window for approximate counting in dense Ising models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Galanis, Andreas, Stefankovic, Daniel, Vigoda, Eric
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Discrete Mathematics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
par: Chen, Zongchen, et autres
Publié: (2023)

Inapproximability of the independent set polynomial in the complex plane
par: Bezakova, Ivona, et autres
Publié: (2017)

Sampling Simultaneous Edge-Colorings
par: Furtado-Tiwari, Ezra, et autres
Publié: (2026)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
par: Galanis, Andreas, et autres
Publié: (2023)

Characterization of the set of zero-noise limits measures of perturbed cellular automata
par: Marsan, Hugo, et autres
Publié: (2024)

Graphs without a partition into two proportionally dense subgraphs
par: Bazgan, Cristina, et autres
Publié: (2018)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
par: Galanis, Andreas, et autres
Publié: (2026)

Parameter estimation for Gibbs distributions
par: Harris, David G., et autres
Publié: (2020)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
par: Jain, Vishesh, et autres
Publié: (2026)

Spectral Independence via Stability and Applications to Holant-Type Problems
par: Chen, Zongchen, et autres
Publié: (2021)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
par: Efthymiou, Charilaos, et autres
Publié: (2023)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2026)

Sharp Online Hardness for Large Balanced Independent Sets
par: Dhawan, Abhishek, et autres
Publié: (2025)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
par: Concha-Vega, Pablo, et autres
Publié: (2025)

On the complexity of freezing automata networks of bounded pathwidth
par: Goles, Eric, et autres
Publié: (2025)

On Computational Aspects of Ordered Matching Problems
par: Čertík, Michal, et autres
Publié: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

On Computational Aspects of Cores of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

Probability-graphons: Limits of large dense weighted graphs
par: Abraham, Romain, et autres
Publié: (2023)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
par: Marcille, Clara, et autres
Publié: (2026)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
par: Carbonnel, Clément
Publié: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
par: Rai, Ashutosh, et autres
Publié: (2026)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
par: Armand, Jules, et autres
Publié: (2025)

On the enumeration of Tarski fixed points
par: Müller, Julian
Publié: (2023)

Edge-Disjoint Paths in Eulerian Digraphs
par: Cavallaro, Dario, et autres
Publié: (2024)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

Relations between monotone complexity measures based on decision tree complexity
par: Byramji, Farzan, et autres
Publié: (2024)

Gap Preserving Reductions Between Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2022)

Computational complexity of the Weisfeiler-Leman dimension
par: Lichter, Moritz, et autres
Publié: (2024)

Gap Amplification for Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2023)

Is Graph Local Complementation Inherently Sequential?
par: Concha-Vega, Pablo
Publié: (2025)

Enumerating Minimal Defensive Alliances
par: Feng, Zhidan, et autres
Publié: (2023)

Counting Subgraphs in Somewhere Dense Graphs
par: Bressan, Marco, et autres
Publié: (2022)

Three Hardness Results for Graph Similarity Problems
par: Sun, He, et autres
Publié: (2023)

How to Reconfigure Your Alliances
par: Fernau, Henning, et autres
Publié: (2025)

List Decoding Quotient Reed-Muller Codes
par: Gotlib, Omri, et autres
Publié: (2025)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)