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

47 papers

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…

q-bio.NC2023★ 5 cited

Energy--Information Trade-off Induces Continuous and Discontinuous Phase Transitions in Lateral Predictive Coding

Zhen-Ye Huang, Ruyi Zhou, Miao Huang +1

Lateral predictive coding is a recurrent neural network which creates energy-efficient internal representations by exploiting statistical regularity in sensory inputs. Here we inve…

cs.LG2022★ 2 cited

An adaptive shortest-solution guided decimation approach to sparse high-dimensional linear regression

Xue Yu, Yifan Sun, Haijun Zhou

High-dimensional linear regression model is the most popular statistical model for high-dimensional data, but it is quite a challenging task to achieve a sparse set of regression c…

cond-mat.dis-nn2022★ 5 cited

Dynamic Gardner crossover in a simple structural glass

Qinyi Liao, Ludovic Berthier, Hai-Jun Zhou +1

The criticality of the jamming transition responsible for amorphous solidification has been theoretically linked to the marginal stability of a thermodynamic Gardner phase. While t…

cond-mat.dis-nn2021★ 10 cited

Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm

Hai-Jun Zhou

The K-core of a graph is the maximal subgraph within which each vertex is connected to at least K other vertices. It is a fundamental network concept for understanding threshold ca…

cs.SI2021★ 10 cited

Minimum Long-Loop Feedback Vertex Set and Network Dismantling

Tianyi Li, Pan Zhang, Hai-Jun Zhou

Network dismantling aims at breaking a network into disconnected components, and attacking vertices that intersect with many loops has proven to be a most efficient strategy. But t…