Journal
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
Volume 462, Issue -, Pages 569-578Publisher
ELSEVIER
DOI: 10.1016/j.physa.2016.06.096
Keywords
Complex networks; Bipartite networks; Asymmetric intimacy; Sub-communities
Categories
Funding
- National Natural Science Foundation of China [61370145, 61173183]
- Program for Liaoning Excellent Talents in University [LR2012003]
Ask authors/readers for more resources
In this paper, an algorithm to choose a good partition in bipartite networks has been proposed. Bipartite networks have more theoretical significance and broader prospect of application. In view of distinctive structure of bipartite networks, in our method, two parameters are defined to show the relationships between the same type nodes and heterogeneous nodes respectively. Moreover, our algorithm employs a new method of finding and expanding the core communities in bipartite networks. Two kinds of nodes are handled separately and merged, and then the sub-communities are obtained. After that, objective communities will be found according to the merging rule. The proposed algorithm has been simulated in real-world networks and artificial networks, and the result verifies the accuracy and reliability of the parameters on intimacy for our algorithm. Eventually, comparisons with similar algorithms depict that the proposed algorithm has better performance. (C) 2016 Elsevier B.V. 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
Recommended
No Data Available