180 citations · 1.1k across the 47 of their papers we have counts for
8 papers · 1 filter
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…
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…
Circumventing spin glass traps by microcanonical spontaneous symmetry breaking
Hai-Jun Zhou, Qinyi Liao
The planted p-spin interaction model is a paradigm of random-graph systems possessing both a ferromagnetic phase and a disordered phase with the latter splitting into many spin gla…
Maximally flexible solutions of a random -satisfiability formula
Han Zhao, Hai-Jun Zhou
Random -satisfiability (-SAT) is a paradigmatic model system for studying phase transitions in constraint satisfaction problems and for developing empirical algorithms. The s…
Optimal segmentation of directed graph and the minimum number of feedback arcs
Yi-Zhi Xu, Hai-Jun Zhou
The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles. In this work w…
Covering Problems and Core Percolations on Hypergraphs
Bruno Coelho Coutinho, Hai-Jun Zhou, Yang-Yu Liu
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims…
On one-step replica symmetry breaking in the Edwards-Anderson spin glass model
Gino Del Ferraro, Chuang Wang, Hai-Jun Zhou +1
We consider a one-step replica symmetry breaking description of the Edwards-Anderson spin glass model in 2D. The ingredients of this description are a Kikuchi approximation to the…
Statistical physics of hard combinatorial optimization: The vertex cover problem
Jin-Hua Zhao, Hai-Jun Zhou
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symm…