A Methodology for Generating Time-Varying Complex Networks with Community Structure

Author(s):  
Sandy Porto ◽  
Marcos G. Quiles
2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lili Zhang ◽  
Qing Ye ◽  
Yehong Shao ◽  
Chenming Li ◽  
Hongmin Gao

Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time-varying of the networks. This paper analyzes some related algorithms and proposes a new algorithm—CN agglomerative algorithm based on graph theory and the local connectedness of network to find communities in network. We show this algorithm is distributed and polynomial; meanwhile the simulations show it is accurate and fine-grained. Furthermore, we modify this algorithm to get one modified CN algorithm and apply it to dynamic complex networks, and the simulations also verify that the modified CN algorithm has high accuracy too.


2015 ◽  
Vol 719-720 ◽  
pp. 448-451
Author(s):  
Li Jie Zeng

In this paper, we investigate the cluster mixed synchronization scheme in time-varying delays coupled complex dynamical networks with disturbance. Basing on the community structure of the networks, some sufficient criteria are derived to ensure cluster mixed synchronization of the network model. Particularly, unknown bounded disturbances can be conquered by the proposed control. The numerical simulations are performed to verify the effectiveness of the theoretical results


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Shuguo Wang ◽  
Chunyuan He ◽  
Hongxing Yao

This paper investigates a new cluster antisynchronization scheme in the time-varying delays coupled complex dynamical networks with nonidentical nodes. Based on the community structure of the networks, the controllers are designed differently between the nodes in one community that have direct connections to the nodes in other communities and the nodes without direct connections with the nodes in other communities strategy; some sufficient criteria are derived to ensure cluster anti-synchronization of the network model. Particularly, the weight configuration matrix is not assumed to be irreducible. The numerical simulations are performed to verify the effectiveness of the theoretical results.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Shuguo Wang ◽  
Hongxing Yao ◽  
Mingping Sun

This paper investigates a new cluster synchronization scheme in the nonlinear coupled complex dynamical networks with nonidentical nodes. The controllers are designed based on the community structure of the networks; some sufficient criteria are derived to ensure cluster synchronization of the network model. Particularly, the weight configuration matrix is not assumed to be symmetric, irreducible. The numerical simulations are performed to verify the effectiveness of the theoretical results.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.


2013 ◽  
Vol 22 (9) ◽  
pp. 090504 ◽  
Author(s):  
Jun-Yi Wang ◽  
Hua-Guang Zhang ◽  
Zhan-Shan Wang ◽  
Hong-Jing Liang

2021 ◽  
Vol 18 (4) ◽  
pp. 3435-3447
Author(s):  
Hai Lin ◽  
◽  
Jingcheng Wang ◽  
◽  

Sign in / Sign up

Export Citation Format

Share Document