Community Detection Based on Graph Dynamical Systems with Asynchronous Runs

A community in a network is a group of nodes that are densely connected internally but sparsely connected externally. We propose a novel approach for detecting communities in networks based on graph dynamical systems (GDS), which are computation models for networks of interacting entities. We introd...

Full description

Saved in:
Bibliographic Details
Published in2014 Second International Symposium on Computing and Networking pp. 463 - 469
Main Authors Jiamou Liu, Ziheng Wei
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2014
Subjects
Color
Communities
Community detection
Computational modeling
dynamic networks
Educational institutions
graph dynamical systems
Heuristic algorithms
Proposals
Vegetation
Online AccessGet full text
ISSN2379-1888
DOI10.1109/CANDAR.2014.20

Cover

More Information
Summary:A community in a network is a group of nodes that are densely connected internally but sparsely connected externally. We propose a novel approach for detecting communities in networks based on graph dynamical systems (GDS), which are computation models for networks of interacting entities. We introduce the Propose-Select-Adjust framework - a GDS-based computation model for solving network problems, and demonstrate how this model may be used in community detection. The advantage of this approach is that computation is distributed to each node which asynchronously computes its own solution. This makes the method suitable for decentralised and dynamic networks.
ISSN:2379-1888
DOI:10.1109/CANDAR.2014.20