Affiliation:
1. College of Science, Guilin University of Technology, Guilin 541006, P. R. China
Abstract
Coarse-graining of complex networks is a hot topic in network science. Coarse-grained networks are required to preserve the topological information or dynamic properties of the original network. Some effective coarse-graining methods have been proposed, while an urgent problem is how to obtain coarse-grained network with optimal scale. In this paper, we propose an extraction algorithm (EA) for optimal coarse-grained networks. Numerical simulation for EA on four kinds of networks and performing Kuramoto model on optimal coarse-grained networks, we find our algorithm can effectively obtain the optimal coarse-grained network.
Funder
National Natural Science Foundation of China
the Natural Science Foundation of Guangxi
Publisher
World Scientific Pub Co Pte Lt
Subject
Computational Theory and Mathematics,Computer Science Applications,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献