Author
Listed:
- Yaoyi Zhang
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
- Qingyu Huang
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
- Guohai Cao
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
- Mengwei Zhao
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
- Siyuan Zhang
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
- Yabo Wu
(Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu 610213, P. R. China)
Abstract
In the field of community detection in complex networks, the most commonly used approach to this problem is the maximization of the benefit function known as “modularity”. In this study, it is found that the path of length two have the similar property as the edge, which is denser within communities and sparser between different communities. In order to take both edge and path of length two into consideration simultaneously, a self-loop is added to each node of the network and a novel benefit function has been defined. To divide the network into two communities, a second eigenvector method is proposed based on maximization of our new benefit function. Experimental results obtained by applying the method to karate club network and dolphin social network show the feasibility of our benefit function and the effectiveness of our algorithm.
Suggested Citation
Yaoyi Zhang & Qingyu Huang & Guohai Cao & Mengwei Zhao & Siyuan Zhang & Yabo Wu, 2021.
"A benefit function for community detection based on edge and path of length two,"
International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-9, June.
Handle:
RePEc:wsi:ijmpcx:v:32:y:2021:i:06:n:s0129183121500820
DOI: 10.1142/S0129183121500820
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:32:y:2021:i:06:n:s0129183121500820. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.