Abstract
Motivated by the relationship of the dynamic behaviors and network structure, in this paper, we present two efficient dynamic community detection algorithms. The phases of the nodes in the network can evolve according to our proposed differential equations. In each iteration, the phases of the nodes are controlled by several parameters. It is found that the phases of the nodes are ultimately clustered into several communities after a short period of evolution. They can be adopted to detect the communities successfully. The second differential equation can dynamically adjust several parameters, so it can obtain satisfactory detection results. Simulations on some test networks have verified the efficiency of the presented algorithms.
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 callDisclaimer: 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.
