Fragmenting complex network based on non-backtracking matrix

DOI10.1088/1742-5468/ABE2A1MaRDI QIDQ5857566zbMATH OpenOpenAlexFDO

Authors Rong-Hua Yuan, Fu-Rui Tan, Wen-Zhou Chen, Ming-Yang Zhou

Publication date 1 April 2021

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1742-5468/abe2a1

zbMATH Keywords

complex networkinfluential nodenetwork percolation

Mathematics Subject Classification ID

Time-dependent percolation in statistical mechanics (82C43)

Recommendations

• Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
• A new evidential methodology of identifying influential nodes in complex networks
• A new method for identifying influential nodes and important edges in complex networks
• Critical node identification for complex network based on a novel minimum connected dominating set
• Identification of influential nodes in complex networks: method from spreading probability viewpoint

Cites work

• Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
• Analytical connection between thresholds and immunization strategies of SIS model in random networks
• Generalized network dismantling
• Identifying influential nodes in complex networks: a node information dimension approach
• Localized eigenvectors of the non-backtracking matrix
• Ranking in evolving complex networks
• Spectral redemption in clustering sparse networks
• The non-backtracking spectrum of the universal cover of a graph
• Toward link predictability of complex networks

Cited in

(2)

• Method of social network dismantling based on neighbor nodes fusion
• Dismantling complex networks based on the principal eigenvalue of the adjacency matrix

This page was built for publication: Fragmenting complex network based on non-backtracking matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857566)