activity
20132020
most citedInducing Effect on the Percolation Transition in Complex Networks

77 citations · 129 across the 8 of their papers we have counts for

collaborators

8 papers

physics.soc-ph2020★ 2 cited

Induced Percolation on Networked Systems

Jiarong Xie, Xiangrong Wang, Ling Feng +3

Percolation theory has been widely used to study phase transitions in complex networked systems. It has also successfully explained several macroscopic phenomena across different f…

physics.soc-ph2018★ 8 cited

Two faces of greedy leaf removal procedure on graphs

Jin-Hua Zhao, Hai-Jun Zhou

The greedy leaf removal (GLR) procedure on a graph is an iterative removal of any vertex with degree one (leaf) along with its nearest neighbor (root). Its result has two faces: a…

physics.soc-ph2017★ 6 cited

Generalized -core pruning process on directed networks

Jin-Hua Zhao

The resilience of a complex interconnected system concerns the size of the macroscopic functioning node clusters after external perturbations based on a random or designed scheme.…

physics.soc-ph2016★ 4 cited

Feedback arcs and node hierarchy in directed networks

Jin-Hua Zhao, Hai-Jun Zhou

Directed networks such as gene regulation networks and neural networks are connected by arcs (directed links). The nodes in a directed network are often strongly interwound by a hu…

physics.soc-ph2016★ 1 cited

Optimal Disruption of Complex Networks

Jin-Hua Zhao, Hai-Jun Zhou

The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwini…

physics.soc-ph2015★ 17 cited

The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation

Yusupjan Habibulla, Jin-Hua Zhao, Hai-Jun Zhou

A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set…

cond-mat.dis-nn2014★ 14 cited

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…

cond-mat.stat-mech2013★ 77 cited

Inducing Effect on the Percolation Transition in Complex Networks

Jin-Hua Zhao, Hai-Jun Zhou, Yang-Yu Liu

Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating c…