HYHongtao Yu

Hongtao Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hongtao Yu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:

  • Qian Li

    Institute of Information Technology, PLA Strategic Support, Force Information Engineering University, Zhengzhou 450000, P. R. China

    2 shared publications
  • Weitao Han

    Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

    2 shared publications
  • Jianpeng Zhang

    Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

    1 shared publication
  • Qian Li

    Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

    1 shared publication
  • Ruiyang Huang

    Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

    1 shared publication
  • Shaomei Li

    Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou, China

    1 shared publication

Latest Publications

  • Robustness of interdependent networks with weak dependency links and reinforced nodes

    by Qian Li, Hongtao Yu, Weitao Han, Ruiyang Huang, Shaomei Li, Jianpeng Zhang


  • Cascading failures in interdependent networks with reinforced crucial nodes and dependency groups

    by Qian Li, Hongtao Yu, Shaomei Li, Shuxin Liu

    Previous studies of group percolation models in interdependent networks with reinforced nodes have rarely addressed the effects of the degree of reinforced nodes and the heterogeneity of group size distribution. In this paper, a cascading failure model in interdependent networks with reinforced crucial nodes and dependency groups is investigated numerically and analytically. For each group, we assume that if all the nodes in a group fail on one network, a node on another network that depends on that group will fail. We find that rich percolation transitions can be classified into three types: discontinuous, continuous, and hybrid phase transitions, which depend on the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Importantly, our proposed crucial reinforced method has higher reinforcement efficiency than the random reinforced method. More significantly, we develop a general theoretical framework to calculate the percolation transition points and the shift point of percolation types. Simulation results show that the robustness of interdependent networks can be improved by increasing the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Our theoretical results can well agree with numerical simulations. These findings might develop a new perspective for designing more resilient interdependent infrastructure networks.


  • Group percolation in interdependent networks with reinforcement network layer

    by Qian Li, Hongtao Yu, Weitao Han, Yiteng Wu

    In many real-world interdependent network systems, nodes often work together to form groups, which can enhance robustness to resist risks. However, previous group percolation models are always of a first-order phase transition, regardless of the group size distribution. This motivates us to investigate a generalized model for group percolation in interdependent networks with a reinforcement network layer to eliminate collapse. Some backup devices that are equipped for a density ρ of reinforced nodes constitute the reinforcement network layer. For each group, we assume that at least one node of the group can function in one network and a node in another network depends on the group to function. We find that increasing the density ρ of reinforcement nodes and the size S of the dependency group can significantly enhance the robustness of interdependent networks. Importantly, we find the existence of a hybrid phase transition behavior and propose a method for calculating the shift point of percolation types. The most interesting finding is the exact universal solution to the minimal density ρmin of reinforced nodes (or the minimum group size Smin ) to prevent abrupt collapse for Erdős–Rényi, scale-free, and regular random interdependent networks. Furthermore, we present the validity of the analytic solutions for a triple point ρc∗ (or Sc∗ ), the corresponding phase transition point pc∗ , and second-order phase transition points pcΠ in interdependent networks. These findings might yield a broad perspective for designing more resilient interdependent infrastructure networks.