Cover Image

On sampling diluted Spin Glasses using Glauber dynamics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Efthymiou, Charilaos, Zampetakis, Kostas
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On sampling diluted Spin-Glasses with unbounded interactions
by: Efthymiou, Charilaos, et al.
Published: (2026)

Spectral Independence Beyond Uniqueness with. the topological method -- An extended view
by: Efthymiou, Charilaos
Published: (2024)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
by: Galanis, Andreas, et al.
Published: (2023)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
by: Efthymiou, Charilaos
Published: (2020)

Cutoff for congestion dynamics and related generalized exclusion processes
by: Tanaka, Ryokichi
Published: (2025)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
by: Gillman, David, et al.
Published: (2026)

Noise sensitivity on affine Weyl groups
by: Tanaka, Ryokichi
Published: (2024)

Theory of Stochastic Drift
by: Kötzing, Timo
Published: (2024)

Multicoloured Hardcore Model: Fast Mixing and Queueing
by: Olesker-Taylor, Sam
Published: (2024)

Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)

Matchings on Random Regular Hypergraphs
by: Li, Zhongyang
Published: (2021)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)

Subtractive random forests
by: Broutin, Nicolas, et al.
Published: (2022)

The Careless Coupon Collector's Problem
by: Cruciani, Emilio, et al.
Published: (2026)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
by: Austin, Henry, et al.
Published: (2026)

Probability-graphons: Limits of large dense weighted graphs
by: Abraham, Romain, et al.
Published: (2023)

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

A threshold for online balancing of sparse i.i.d. vectors
by: Altschuler, Dylan J., et al.
Published: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)