Cover Image

Glauber dynamics for the hard-core model on bounded-degree $H$-free graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Jerrum, Mark
Format:	Preprint
Published:	2024
Subjects:	Probability Data Structures and Algorithms Combinatorics 05C69 (Primary) 60J10, 68W20, 82B20 (Secondary) F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs
by: Kuchukova, Aiya, et al.
Published: (2024)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Optimal non-adaptive algorithm for edge estimation
by: Bishnu, Arijit, et al.
Published: (2025)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)

Mean-Biased Processes for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
by: Feng, Weiming, et al.
Published: (2022)

Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

The antiferromagnetic Ising model beyond line graphs
by: Jerrum, Mark
Published: (2026)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
by: Davies, Ewan, et al.
Published: (2026)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
by: Chiclana, Rafael, et al.
Published: (2025)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
by: Gupta, Swati, et al.
Published: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
by: Gupta, Swati, et al.
Published: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)

Stochastic Function Certification with Correlations
by: Ghuge, Rohan, et al.
Published: (2026)

On Conjectures concerning the Labeled Coupon Collector Problem
by: Barak-Pelleg, Dina, et al.
Published: (2025)

An asymptotically optimal algorithm for generating bin cardinalities
by: Devroye, Luc, et al.
Published: (2024)

On the zeros of partition functions with multi-spin interactions
by: Barvinok, Alexander
Published: (2024)

Adaptive Approximation Schemes for Matching Queues
by: AmaniHamedani, Alireza, et al.
Published: (2025)

The Exchange Problem
by: Garg, Mohit, et al.
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Mallows Model with Learned Distance Metrics: Sampling and Maximum Likelihood Estimation
by: Alimohammadi, Yeganeh, et al.
Published: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)