Cover Image

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Efthymiou, Charilaos
Format:	Preprint
Published:	2020
Subjects:	Discrete Mathematics Combinatorics 68R99, 68W25, 68W20, 82B44
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

Algorithms for the ferromagnetic Potts model on expanders
by: Carlson, Charlie, et al.
Published: (2022)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Belief Propagation Guided Decimation on Random k-XORSAT
by: Chatterjee, Arnab, et al.
Published: (2025)

On the complex zeros and the computational complexity of approximating the reliability polynomial
by: Bencs, Ferenc, et al.
Published: (2025)

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

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

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
by: Mehiri, El-Mehdi
Published: (2025)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

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

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

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

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
by: Chatterjee, Arnab
Published: (2025)

Dirac's theorem and the switch geometry of perfect matchings
by: Kang, Ross J., et al.
Published: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

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

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)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

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

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

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

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herding
by: Rouault, Martin, et al.
Published: (2024)

Compilation of Generalized Matrix Chains with Symbolic Sizes
by: López, Francisco, et al.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)