Abstract
For two vertices i and j in a connected network G, the resistance distance between i and j is defined to be the effective resistance between them when unit resistors are placed on every edge of G. In this paper, by utilizing Gaussian function of the resistance distance between two vertices associated with each edge, the original network G is converted into weighted network G′. Next, applying the bisection spectral method, the G′ is divided into two subnetworks. And repeat this process in the subnetwork, the community structure of G is detected. Three real-world networks are used to test the proposed method. Experimental results demonstrate the feasibility and effectiveness by the proposed method in comparison with other community discovery methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
