activity
20092023
most citedIdentifying optimal targets of network attack by belief propagation

180 citations · 1.1k across the 47 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

9 papers · 1 filter

cond-mat.stat-mech2023

Planted vertex cover problem on regular random graphs and nonmonotonic temperature-dependence in the supercooled region

Xin-Yi Fan, Hai-Jun Zhou

We introduce a planted vertex cover problem on regular random graphs and study it by the cavity method of statistical mechanics. Different from conventional Ising models, the equil…

cond-mat.stat-mech2019★ 14 cited

Solving Statistical Mechanics on Sparse Graphs with Feedback Set Variational Autoregressive Networks

Feng Pan, Pengfei Zhou, Hai-Jun Zhou +1

We propose a method for solving statistical mechanics problems defined on sparse graphs. It extracts a small Feedback Vertex Set (FVS) from the sparse graph, converting the sparse…

cond-mat.stat-mech2019★ 6 cited

Kinked Entropy and Discontinuous Microcanonical Spontaneous Symmetry Breaking

Hai-Jun Zhou

Spontaneous symmetry breaking (SSB) in statistical physics is a macroscopic collective phenomenon. For the paradigmatic Q-state Potts model it means a transition from the disordere…

cond-mat.stat-mech2018★ 6 cited

Hidden thermal structure in Fock space

Chushun Tian, Kun Yang, Ping Fang +2

The emergence of quantum statistical mechanics from individual pure states of closed many-body systems is currently under intensive investigations. While most efforts have been put…

cond-mat.stat-mech2018★ 9 cited

Entropy Inflection and Invisible Low-Energy States: Defensive Alliance Example

Yi-Zhi Xu, Chi Ho Yeung, Hai-Jun Zhou +1

Lower temperature leads to a higher probability of visiting low-energy states. This intuitive belief underlies most physics-inspired strategies for addressing hard optimization pro…

cond-mat.stat-mech2016★ 7 cited

Spin glass phase transitions in the random feedback vertex set problem

Shao-Meng Qin, Ying Zeng, Hai-Jun Zhou

A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the w…