Copertina

On sampling two spin models using the local connective constant

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Efthymiou, Charilaos
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Discrete Mathematics Mathematical Physics 68R99, 68W25, 68W20
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

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

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

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

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

Fundamentals of Partial Rejection Sampling
di: Jerrum, Mark
Pubblicazione: (2021)

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

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

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

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

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

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

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

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

On Finding Randomly Planted Cliques in Arbitrary Graphs
di: Agrimonti, Francesco, et al.
Pubblicazione: (2025)

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

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

Exact block encoding of imaginary time evolution with universal quantum neural networks
di: Rrapaj, Ermal, et al.
Pubblicazione: (2024)

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

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

Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
di: Simmons, Miles, et al.
Pubblicazione: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
di: Sun, Hao
Pubblicazione: (2023)

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

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

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

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

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

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

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

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

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

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

Floating Point Compression of Hierarchical Matrix Formats and its Impact on Matrix-Vector Multiplication
di: Kriemann, Ronald
Pubblicazione: (2024)

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

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

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