4.7 Article

Generalized k -core percolation on higher-order dependent networks

Journal

APPLIED MATHEMATICS AND COMPUTATION
Volume 420, Issue -, Pages -

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2021.126793

Keywords

Generalized k -core percolation; Dependent networks; Higher-order dependent network

Funding

  1. National Natural Science Foundation of China [61903266, 62006122]
  2. Sichuan Science and Technology Program [2020YJ0048]
  3. Natural Science Foundation of Chongqing [cstc2021jcyj-msxmX0132]

Ask authors/readers for more resources

This paper proposes a generalized k-core percolation model to investigate the robustness of higher-order dependent networks. The study reveals the impact of average degree, intralayer dependency, and degree heterogeneity on system robustness using percolation theory and numerical simulations.
In biology and technology systems , the proper functioning of agents may be mutually interdependent, where the failure of an agent can cause the dysfunctionality of other dependent agents. Usually, we adopt the dependence network to capture such dependency relations among agents; however, the interdependency relations are only pairwise but could be of higher-order. In other words, an agent's failure can induce the failure of several other nodes in a high-order interaction (e.g., the same group or clique) simultaneously. In this paper, we propose a generalized k-core percolation model to investigate the robustness of the higher-order dependent networks. In particular, we consider higher-order multi-layered dependency networks where both the interlayer and intralayer dependency relations are of a high order. We study the model using percolation theory and numerical simulations and find that the k-core percolation threshold and phase transition type depend on the average degree. Increasing the average degree enhances the system robustness. The system exhibits a discontinuous phase transition with a small k-core percolation threshold for networks with small average degree. Meanwhile, for networks with large average degrees, the system can either shows a continuous phase transition with a small k-core percolation threshold or a discontinuous phase transition with a large percolation threshold. In addition, we find that the intralayer dependency enhances the robustness of the system. Finally, we reveal that the degree heterogeneity makes the network more fragile. The above stated phenomena are well predicted by our developed percolation theory.(c) 2021 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available