Cover Image

On expectations and variances in the hard-core model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Weiyuan, Xu, Kexiang
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)

On asymptotic values for the minimum number of spanning forests in simple regular graphs
by: Xu, Shaohan, et al.
Published: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

On the transmission irregular trees with the maximum Wiener index
by: Damnjanović, Ivan, et al.
Published: (2025)

Note on a conjecture of Talagrand: expectation thresholds vs. fractional expectation thresholds
by: Dubroff, Quentin, et al.
Published: (2024)

Uniquely $C_{4}^{+}$-saturated graphs
by: Li, Yuying, et al.
Published: (2024)

Decay of correlations and zeros for the hard-core model
by: Peters, Han, et al.
Published: (2026)

Rearrangements of distributions on integers that minimize variance
by: Atminas, Aistis, et al.
Published: (2025)

Further remarks on fractional vs. expectation thresholds
by: Fischer, Thomas, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

On the critical fugacity of the hard-core model on regular bipartite graphs
by: Hadas, Daniel, et al.
Published: (2026)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
by: Jenssen, Matthew, et al.
Published: (2024)

Computing the degreewidth of a digraph is hard
by: Aboulker, Pierre, et al.
Published: (2024)

Variants of the Erdős distinct sums problem and variance method
by: Costa, Simone, et al.
Published: (2024)

Tight bounds for expected propagation time of probabilistic zero forcing
by: Jelassi, Mehdi, et al.
Published: (2025)

Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs
by: Xu, Zhen-Peng, et al.
Published: (2025)

King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Graceful coloring is computationally hard
by: Antony, Cyriac, et al.
Published: (2024)

Thresholds and expectation thresholds for larger p
by: Przybyłowski, Tomasz, et al.
Published: (2023)

Thresholds vs. expectation thresholds for non-spanning graphs
by: Dubroff, Quentin
Published: (2026)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

Direct Product Primality Testing of Graphs is GI-hard
by: Calderoni, Luca, et al.
Published: (2020)

An NP-hard generalization of Nim
by: Liu, Chunlei
Published: (2024)

Shellability is hard even for balls
by: Paták, Pavel, et al.
Published: (2022)

Computing the EHZ capacity is NP-hard
by: Leipold, Karla, et al.
Published: (2024)

Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)

Quantum pricing-based column-generation framework for hard combinatorial problems
by: Coelho, Wesley da Silva, et al.
Published: (2023)

Concentration of the largest induced tree size of $G_{n,p}$ around the standard expectation threshold
by: Hofstad, Jakob
Published: (2026)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)

On the hardness of recognizing graphs of small mim-width and its variants
by: la Tour, Max Dupré, et al.
Published: (2025)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
by: Ikenmeyer, Christian, et al.
Published: (2022)

An improved upper bound for planar Turán number of double star $S_{2,5}$
by: Xu, Xin, et al.
Published: (2024)

The hard-core model in graph theory
by: Davies, Ewan, et al.
Published: (2025)

Inverse model for network construction: (δ(G), I' (G)) -> G
by: Gao, Wei, et al.
Published: (2024)

On the expected value of energy in groups
by: Barbieri, Marco, et al.
Published: (2026)

A simple proof of the formula of Solov'ev--Nielsen--Blom for the expected waiting time
by: Yoshida, Yuuya
Published: (2024)

The Outerplanar Turán Number of Double Stars
by: Zhang, Chaofan, et al.
Published: (2026)