JZJianwen Zhou
Jianwen Zhou
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianwen Zhou has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hai-Jun Zhou
Institute of Theoretical Physics
3 shared publications - Ruifeng Liu
School of Physical Sciences University of Chinese Academy of Sciences 100049 Beijing China
1 shared publication - Yejia Chen
Institute of Theoretical Physics
1 shared publication
Latest Publications
- Open Access
The stability of long-range order in disordered systems: A generalized Ding-Zhuang argument
The stability of long-range order against quenched disorder is a central problem in statistical mechanics. This paper develops a generalized framework extending the Ding-Zhuang method and integrated with the Pirogov-Sinai framework, establishing a systematic scheme for studying phase transitions of long-range order in disordered systems. We axiomatize the Ding-Zhuang approach into a theoretical framework consisting of the Peierls condition and a local symmetry condition. For systems in dimensions $d \geq 3$ satisfying these conditions, we prove the persistence of long-range order at low temperatures and under weak disorder, with multiple coexisting distinct Gibbs states. The framework's versatility is demonstrated for diverse models, providing a systematic extension of Peierls methods to disordered systems.Open AccessThe stability of long-range order in disordered systems: A generalized Ding-Zhuang argument
The stability of long-range order against quenched disorder is a central problem in statistical mechanics. This paper develops a generalized framework extending the Ding-Zhuang method and integrated with the Pirogov-Sinai framework, establishing a systematic scheme for studying phase transitions of long-range order in disordered systems. We axiomatize the Ding-Zhuang approach into a theoretical framework consisting of the Peierls condition and a local symmetry condition. For systems in dimensions $d \geq 3$ satisfying these conditions, we prove the persistence of long-range order at low temperatures and under weak disorder, with multiple coexisting distinct Gibbs states. The framework's versatility is demonstrated for diverse models, providing a systematic extension of Peierls methods to disordered systems. - 12 December 2023
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 190 (12) , 1-24
Hierarchical Cycle-Tree Packing Model for Optimal K-Core Attack
- 12 December 2023
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 190 (12) , 1-24
Hierarchical Cycle-Tree Packing Model for Optimal K-Core Attack
- Open Access
Hierarchical cycle-tree packing model for $K$-core attack problem
The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its complete collapse. A hierarchical cycle-tree packing model is introduced here for this challenging combinatorial optimization problem. We convert the temporally long-range correlated $K$-core pruning dynamics into locally tree-like static patterns and analyze this model through the replica-symmetric cavity method of statistical physics. A set of coarse-grained belief propagation equations are derived to predict single vertex marginal probabilities efficiently. The associated hierarchical cycle-tree guided attack ({\tt hCTGA}) algorithm is able to construct nearly optimal attack solutions for regular random graphs and Erdös-Rényi random graphs. Our cycle-tree packing model may also be helpful for constructing optimal initial conditions for other irreversible dynamical processes on sparse random graphs.Open AccessHierarchical cycle-tree packing model for $K$-core attack problem
The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its complete collapse. A hierarchical cycle-tree packing model is introduced here for this challenging combinatorial optimization problem. We convert the temporally long-range correlated $K$-core pruning dynamics into locally tree-like static patterns and analyze this model through the replica-symmetric cavity method of statistical physics. A set of coarse-grained belief propagation equations are derived to predict single vertex marginal probabilities efficiently. The associated hierarchical cycle-tree guided attack ({\tt hCTGA}) algorithm is able to construct nearly optimal attack solutions for regular random graphs and Erdös-Rényi random graphs. Our cycle-tree packing model may also be helpful for constructing optimal initial conditions for other irreversible dynamical processes on sparse random graphs.