10 citations · 10 across the 2 of their papers we have counts for
3 papers
cond-mat.stat-mech2026
A general framework for crystallization in maximal hard-core models
Alexander Barg, Qidong He, Geyang Wang
We study general maximal hard-core models on periodic lattice-type graphs. While for standard models, phase coexistence may arise for high activity, for maximal models this behavio…
math.CO2025
The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
Geyang Wang, Alexander Barg, Navin Kashyap
Recoverable systems provide coarse models of data storage on the two-dimensional square lattice, where each site reconstructs its value from neighboring sites according to a specif…
cs.IT2009★ 10 cited
On the Number of Errors Correctable with Codes on Graphs
Alexander Barg, Arya Mazumdar
We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to…