Analytical results of the k-core pruning process on multiplex networks

Multiplex networks are generally considered as networks that have the same set of vertices but different types of edges. Multiplex networks are especially useful when describing systems with several kinds of interactions. In this paper, we study the analytical solution of the k -core pruning process...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers in physics 2022-12, Vol.10
Main Authors: Wu, Rui-Jie, Kong, Yi-Xiu, Zhang, Yi-Cheng, Shi, Gui-Yuan
Format: Article
Language:English
Subjects:
complex network
complex system
k-core
multiplex network
network theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multiplex networks are generally considered as networks that have the same set of vertices but different types of edges. Multiplex networks are especially useful when describing systems with several kinds of interactions. In this paper, we study the analytical solution of the k -core pruning process on multiplex networks. k -Core decomposition is a widely used method to find the dense core of the network. Previously, the Non-Backtracking Expansion Branch (NBEB) has been found to be able to easily derive the exact analytical results in the k -core pruning process. Here, we further extend this method to solve the k -core pruning process on multiplex networks by designing a variation of the method called the Multicolor Non-Backtracking Expansion Branch (MNEB). Our results show that, given any uncorrelated multiplex network, the Multicolor Non-Backtracking Expansion Branch can offer the exact solution for each intermediate state of the pruning process.
ISSN:2296-424X
2296-424X
DOI:10.3389/fphy.2022.1076314