scholarly journals Game Theory and Extremal Optimization for Community Detection in Complex Dynamic Networks

PLoS ONE ◽  
2014 ◽  
Vol 9 (2) ◽  
pp. e86891 ◽  
Author(s):  
Rodica Ioana Lung ◽  
Camelia Chira ◽  
Anca Andreica
2017 ◽  
Vol 12 (2) ◽  
pp. 351-377 ◽  
Author(s):  
Daniel K. Sewell ◽  
Yuguo Chen

2018 ◽  
Vol 3 (3) ◽  
pp. 236
Author(s):  
Priyangika R. Piyasinghe ◽  
J. Morris Chang

2018 ◽  
Vol 115 (5) ◽  
pp. 927-932 ◽  
Author(s):  
Fuchen Liu ◽  
David Choi ◽  
Lu Xie ◽  
Kathryn Roeder

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.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Yiping Luo ◽  
Yuejie Yao

The finite-time synchronization control is studied in this paper for a class of nonlinear uncertain complex dynamic networks. The uncertainties in the network are unknown but bounded and satisfy some matching conditions. The coupling relationship between network nodes is described by a nonlinear function satisfying the Lipchitz condition. By introducing a simple Lyapunov function, two main results regarding finite-time synchronization of a class of complex dynamic networks with parameter uncertainties are derived. By employing some analysis techniques like matrix inequalities, suitable controllers can be designed based on the obtained synchronization criteria. Moreover, with the obtained control input, the time instant required for the system to achieve finite-time synchronization can be estimated if a set of LMIs are feasible or an assumption on the eigenvalues of some matrices can be satisfied. Finally, the effectiveness of the proposed results is verified by numerical simulation.


Computer ◽  
2013 ◽  
Vol 46 (4) ◽  
pp. 24-29 ◽  
Author(s):  
Pavlos Basaras ◽  
Dimitrios Katsaros ◽  
Leandros Tassiulas

2009 ◽  
Vol 3 (4) ◽  
pp. 266-278 ◽  
Author(s):  
G.S. Thakur ◽  
A.W.M. Dress ◽  
R. Tiwari ◽  
S.-S. Chen ◽  
M.T. Thai

Sign in / Sign up

Export Citation Format

Share Document