scholarly journals Identifying Communities in Dynamic Networks Using Information Dynamics

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 425
Author(s):  
Zejun Sun ◽  
Jinfang Sheng ◽  
Bin Wang ◽  
Aman Ullah ◽  
FaizaRiaz Khawaja
Keyword(s):  
Community Detection ◽  
Dynamic Networks ◽  
Parameter Tuning ◽  
Detection Algorithm ◽  
Network Evolution ◽  
Detection Methods ◽  
Detection Accuracy ◽  
Information Dynamics ◽  
Dynamic Community Detection ◽  
Dynamic Community

Identifying communities in dynamic networks is essential for exploring the latent network structures, understanding network functions, predicting network evolution, and discovering abnormal network events. Many dynamic community detection methods have been proposed from different viewpoints. However, identifying the community structure in dynamic networks is very challenging due to the difficulty of parameter tuning, high time complexity and detection accuracy decreasing as time slices increase. In this paper, we present a dynamic community detection framework based on information dynamics and develop a dynamic community detection algorithm called DCDID (dynamic community detection based on information dynamics), which uses a batch processing technique to incrementally uncover communities in dynamic networks. DCDID employs the information dynamics model to simulate the exchange of information among nodes and aims to improve the efficiency of community detection by filtering out the unchanged subgraph. To illustrate the effectiveness of DCDID, we extensively test it on synthetic and real-world dynamic networks, and the results demonstrate that the DCDID algorithm is superior to the representative methods in relation to the quality of dynamic community detection.

scholarly journals Global spectral clustering in dynamic networks

2018 ◽  
Vol 115 (5) ◽  
pp. 927-932 ◽  
Author(s):  
Fuchen Liu ◽  
David Choi ◽  
Lu Xie ◽  
Kathryn Roeder
Keyword(s):  
Community Detection ◽  
Spectral Clustering ◽  
Signal To Noise Ratio ◽  
Dynamic Networks ◽  
Brain Regions ◽  
Tuning Parameter ◽  
Expression Data ◽  
Dynamic Community Detection ◽  
Dynamic Community ◽  
Better Than

Community detection is challenging when the network structure is estimated with uncertainty. Dynamic networks present additional challenges but also add information across time periods. We propose a global community detection method, persistent communities by eigenvector smoothing (PisCES), that combines information across a series of networks, longitudinally, to strengthen the inference for each period. Our method is derived from evolutionary spectral clustering and degree correction methods. Data-driven solutions to the problem of tuning parameter selection are provided. In simulations we find that PisCES performs better than competing methods designed for a low signal-to-noise ratio. Recently obtained gene expression data from rhesus monkey brains provide samples from finely partitioned brain regions over a broad time span including pre- and postnatal periods. Of interest is how gene communities develop over space and time; however, once the data are divided into homogeneous spatial and temporal periods, sample sizes are very small, making inference quite challenging. Applying PisCES to medial prefrontal cortex in monkey rhesus brains from near conception to adulthood reveals dense communities that persist, merge, and diverge over time and others that are loosely organized and short lived, illustrating how dynamic community detection can yield interesting insights into processes such as brain development.

Community Detection Approaches in Real World Networks

2014 ◽  
Vol 6 (1) ◽  
pp. 35-51 ◽  
Author(s):  
Pooja Wadhwa ◽  
M.P.S Bhatia
Keyword(s):  
Community Detection ◽  
Online Social Networks ◽  
Temporal Dynamics ◽  
Detection Methods ◽  
Unified Approach ◽  
Detection Algorithms ◽  
Dynamic Community Detection ◽  
Dynamic Communities ◽  
Dynamic Community

Online social networks have been continuously evolving and one of their prominent features is the evolution of communities which can be characterized as a group of people who share a common relationship among themselves. Earlier studies on social network analysis focused on static network structures rather than dynamic processes, however, with the passage of time, the networks have also evolved and the researchers have started to focus on the aspect of studying dynamic behavior of networks. This paper aims to present an overview of community detection approaches graduating from static community detection methods towards the methods to identify dynamic communities in networks. The authors also present a classification of the existing dynamic community detection algorithms along the dimension of studying the evolution as either a two-step approach comprising of community detection via static methods and then applying temporal dynamics or a unified approach which comprises of dynamic detection of communities along with their evolutionary characteristics.

Sign in / Sign up

Export Citation Format

Share Document