arXiv · 1811.04295
Using NonBacktracking Expansion to Analyze k-core Pruning Process
Abstract
We induce the NonBacktracking Expansion Branch method to analyze the k-core pruning process on the monopartite graph G which does not contain any self-loop or multi-edge. Different from the traditional approaches like the generating functions or the degree distribution evolution equations which are mathematically difficult to solve, this method provides a simple and intuitive solution of the k-core pruning process. Besides, this method can be naturally extended to study the k-core pruning process on correlated networks, which is among the few attempts to analytically solve the problem.
Explore related subjects
Keep this discovery
Rui-jie Wu, Yi-Xiu Kong, Gui-yuan Shi, Yi-Cheng Zhang. 2018-11-10. Using NonBacktracking Expansion to Analyze k-core Pruning Process. https://arxiv.org/abs/1811.04295
Cite the original work for its findings. Save a collection to share your selection of sources.