Image de couverture de livre

On zeros and algorithms for disordered systems: mean-field spin glasses

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bencs, Ferenc, Huang, Brice, Lee, Daniel Z., Liu, Kuikui, Regts, Guus
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Disordered Systems and Neural Networks Discrete Mathematics Mathematical Physics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Barvinok's interpolation method meets Weitz's correlation decay approach
par: Bencs, Ferenc, et autres
Publié: (2025)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Approximating the volume of a truncated relaxation of the independence polytope
par: Bencs, Ferenc, et autres
Publié: (2024)

A near-optimal zero-free disk for the Ising model
par: Patel, Viresh, et autres
Publié: (2023)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
par: Bencs, Ferenc, et autres
Publié: (2023)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)

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

Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses
par: Huang, Brice, et autres
Publié: (2024)

Sampling from the Continuous Random Energy Model in Total Variation Distance
par: Lee, Holden, et autres
Publié: (2024)

Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
par: Sellke, Mark
Publié: (2025)

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

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
par: Liu, Jingcheng, et autres
Publié: (2026)

A Tight Bound on Localization of Electrical Flows
par: Gurel-Gurevich, Ori, et autres
Publié: (2026)

Faster Mixing of the Jerrum-Sinclair Chain
par: Chen, Xiaoyu, et autres
Publié: (2025)

Sink-free orientations: a local sampler with applications
par: Anand, Konrad, et autres
Publié: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
par: Nuti, Pranav, et autres
Publié: (2022)

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

Constructive l2-Discrepancy Minimization with Additive Deviations
par: Dutta, Kunal
Publié: (2025)

Rumors on evolving graphs through stationary times
par: Bonasorte, Vicenzo
Publié: (2025)

Phase Transitions via Complex Extensions of Markov Chains
par: Liu, Jingcheng, et autres
Publié: (2024)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
par: Feng, Weiming, et autres
Publié: (2025)

The Compilability Thresholds of 2-CNF to OBDD
par: de Colnet, Alexis, et autres
Publié: (2026)

Boltzmann Sampling for Powersets without an Oracle
par: Peyen, Jean
Publié: (2026)

Integrating High-Dimensional Functions Deterministically
par: Gamarnik, David, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

Cycle-factors of regular graphs via entropy
par: Christoph, Micha, et autres
Publié: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
par: Bansal, Nikhil, et autres
Publié: (2025)

Probabilistic estimates of the diameters of the Rubik's Cube groups
par: Hirata, So
Publié: (2024)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

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

Approximation algorithms for non-sequential star packing problems
par: Hu, Mengyuan, et autres
Publié: (2024)

An approximation algorithm for Maximum DiCut vs. Cut
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

Optimally revealing bits for rejection sampling
par: Langevin, Louis-Roy, et autres
Publié: (2025)

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

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

Fast approximation algorithms for the 1-median problem on real-world large graphs
par: Ueta, Keisuke, et autres
Publié: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
par: Foucaud, Florent, et autres
Publié: (2025)