scholarly journals Complex Networks: Statistical Properties, Community Structure, and Evolution

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Lei Zhang ◽  
Jianxiang Cao ◽  
Jianyu Li
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Chinese Character ◽  
Structure Evolution ◽  
Data Sets ◽  
Node Number ◽  
Complex Network Theory ◽  
Scale Free ◽  
Character Network ◽  
And Function

We investigate the function for different networks based on complex network theory. In this paper, we choose five data sets from various areas to study. In the study of Chinese network, scale-free effect and hierarchical structure features are found in this complex system. These results indicate that the discovered features of Chinese character structure reflect the combination nature of Chinese characters. In addition, we study the community structure in Chinese character network. We can find that community structure is always considered as one of the most significant features in complex networks, and it plays an important role in the topology and function of the networks. Furthermore, we cut all the nodes in the different networks from low degree to high degree and then obtain many networks with different scale. According to the study, two interesting results have been obtained. First, the relationship between the node number of the maximum communities and the number of communities in the corresponding networks is studied and it is linear. Second, when the number of nodes in the maximum communities is increasing, the increasing tendency of the number of its edges slows down; we predict the complex networks have sparsity. The study effectively explains the characteristic and community structure evolution on different networks.

scholarly journals A Method To Improve The Time Of Computing For Detecting Community Structure In Social Network Graph

2019 ◽  
Vol 8 (6) ◽  
pp. 933-937
Keyword(s):  
Community Structure ◽  
Social Network ◽  
Complex Networks ◽  
Large Scale ◽  
Linear Time ◽  
A Priori ◽  
Label Propagation ◽  
Data Sets ◽  
Network Graph ◽  
Priori Information

Identifying communities has always been a fundamental task in analysis of complex networks. Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of communities or are computationally expensive. Amongst them, the label propagation algorithm (LPA) brings great scaslability together with high accuracy but which is not accurate enough because of its randomness. In this paper, we study the equivalence properties of nodes on social network graphs according to the labeling criteria to shorten social network graphs and develop label propagation algorithms on shortened graphs to discover effective social networking communities without requiring optimization of the objective function as well as advanced information about communities. Test results on sample data sets show that the proposed algorithm execution time is significantly reduced compared to the published algorithms. The proposed algorithm takes an almost linear time and improves the overall quality of the identified community in complex networks with a clear community structure.

The Dynamics on Single Networks

2018 ◽  
Author(s):  
Ginestra Bianconi
Keyword(s):  
Complex Networks ◽  
Diffusion Processes ◽  
Network Dynamics ◽  
Dynamical Behaviour ◽  
Emergent Properties ◽  
Epidemic Spreading ◽  
Scale Free ◽  
Free Network ◽  
The Rich ◽  
And Function

This chapter provides the relevant background on the network dynamics of complex networks formed by just one layer (single networks). Emergent properties of network dynamics are characterized using the framework of phase transitions. The major results on robustness of complex networks, percolation theory and epidemic spreading are presented, revealing the rich interplay between network structure and function. In this context particular emphasis is given to the implications of the scale-free network topology on these dynamical processes. Diffusion processes and synchronization and controllability are characterized on networks, revealing the relevance of spectral properties and peripheral nodes for determining their dynamical behaviour.

Existence of chimera-like state in community structured networks

2020 ◽  
Vol 31 (05) ◽  
pp. 2050069 ◽  
Author(s):  
Nastaran Lotfi ◽  
Amir Hossein Darooneh
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Complex Network ◽  
Community Structures ◽  
Global Synchronization ◽  
Scale Free ◽  
Chimera State ◽  
Mixing Parameter ◽  
Scale Free Networks ◽  
Network Area

Synchronization is getting high attention in different fields specially in complex network area in the recent years. One of its new aspects is Chimera state in which some groups of oscillators are synchronized while the others are in the incoherent state. Here, we study how this state depends on the community structure in complex networks. In this work, we consider scale-free networks with community structures and study how the measurements such as the size of the community and mixing parameter could influence the global synchronization and chimera-like state.

scholarly journals A detailed characterization of complex networks using Information Theory

2021 ◽  
Author(s):  
CGS Freitas ◽  
ALL Aquino ◽  
HS Ramos ◽  
Alejandro Frery ◽  
OA Rosso
Keyword(s):  
Information Theory ◽  
Complex Networks ◽  
Complex Network ◽  
Preferential Attachment ◽  
Configuration Model ◽  
Complex Network Theory ◽  
Scale Free ◽  
Network Entropy ◽  
Law Degree

Understanding the structure and the dynamics of networks is of paramount importance for many scientific fields that rely on network science. Complex network theory provides a variety of features that help in the evaluation of network behavior. However, such analysis can be confusing and misleading as there are many intrinsic properties for each network metric. Alternatively, Information Theory methods have gained the spotlight because of their ability to create a quantitative and robust characterization of such networks. In this work, we use two Information Theory quantifiers, namely Network Entropy and Network Fisher Information Measure, to analyzing those networks. Our approach detects non-trivial characteristics of complex networks such as the transition present in the Watts-Strogatz model from k-ring to random graphs; the phase transition from a disconnected to an almost surely connected network when we increase the linking probability of Erdős-Rényi model; distinct phases of scale-free networks when considering a non-linear preferential attachment, fitness, and aging features alongside the configuration model with a pure power-law degree distribution. Finally, we analyze the numerical results for real networks, contrasting our findings with traditional complex network methods. In conclusion, we present an efficient method that ignites the debate on network characterization.

scholarly journals Combining complex networks and data mining: why and how

2016 ◽  
Author(s):  
M. Zanin ◽  
D. Papo ◽  
P. A. Sousa ◽  
E. Menasalvas ◽  
A. Nicchi ◽  
...  
Keyword(s):  
Data Mining ◽  
Complex Networks ◽  
Complex Network ◽  
Network Theory ◽  
Data Sets ◽  
Complex Network Theory ◽  
Data Mining Algorithms ◽  
Starting Point ◽  
The Face ◽  
General Goal

AbstractThe increasing power of computer technology does not dispense with the need to extract meaningful in-formation out of data sets of ever growing size, and indeed typically exacerbates the complexity of this task. To tackle this general problem, two methods have emerged, at chronologically different times, that are now commonly used in the scientific community: data mining and complex network theory. Not only do complex network analysis and data mining share the same general goal, that of extracting information from complex systems to ultimately create a new compact quantifiable representation, but they also often address similar problems too. In the face of that, a surprisingly low number of researchers turn out to resort to both methodologies. One may then be tempted to conclude that these two fields are either largely redundant or totally antithetic. The starting point of this review is that this state of affairs should be put down to contingent rather than conceptual differences, and that these two fields can in fact advantageously be used in a synergistic manner. An overview of both fields is first provided, some fundamental concepts of which are illustrated. A variety of contexts in which complex network theory and data mining have been used in a synergistic manner are then presented. Contexts in which the appropriate integration of complex network metrics can lead to improved classification rates with respect to classical data mining algorithms and, conversely, contexts in which data mining can be used to tackle important issues in complex network theory applications are illustrated. Finally, ways to achieve a tighter integration between complex networks and data mining, and open lines of research are discussed.

scholarly journals A detailed characterization of complex networks using Information Theory

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Cristopher G. S. Freitas ◽  
Andre L. L. Aquino ◽  
Heitor S. Ramos ◽  
Alejandro C. Frery ◽  
Osvaldo A. Rosso
Keyword(s):  
Information Theory ◽  
Complex Networks ◽  
Complex Network ◽  
Preferential Attachment ◽  
Configuration Model ◽  
Complex Network Theory ◽  
Scale Free ◽  
Network Entropy ◽  
Law Degree

Abstract Understanding the structure and the dynamics of networks is of paramount importance for many scientific fields that rely on network science. Complex network theory provides a variety of features that help in the evaluation of network behavior. However, such analysis can be confusing and misleading as there are many intrinsic properties for each network metric. Alternatively, Information Theory methods have gained the spotlight because of their ability to create a quantitative and robust characterization of such networks. In this work, we use two Information Theory quantifiers, namely Network Entropy and Network Fisher Information Measure, to analyzing those networks. Our approach detects non-trivial characteristics of complex networks such as the transition present in the Watts-Strogatz model from k-ring to random graphs; the phase transition from a disconnected to an almost surely connected network when we increase the linking probability of Erdős-Rényi model; distinct phases of scale-free networks when considering a non-linear preferential attachment, fitness, and aging features alongside the configuration model with a pure power-law degree distribution. Finally, we analyze the numerical results for real networks, contrasting our findings with traditional complex network methods. In conclusion, we present an efficient method that ignites the debate on network characterization.

scholarly journals A detailed characterization of complex networks using Information Theory

2021 ◽  
Author(s):  
CGS Freitas ◽  
ALL Aquino ◽  
HS Ramos ◽  
Alejandro Frery ◽  
OA Rosso
Keyword(s):  
Information Theory ◽  
Complex Networks ◽  
Complex Network ◽  
Preferential Attachment ◽  
Configuration Model ◽  
Complex Network Theory ◽  
Scale Free ◽  
Network Entropy ◽  
Law Degree

Understanding the structure and the dynamics of networks is of paramount importance for many scientific fields that rely on network science. Complex network theory provides a variety of features that help in the evaluation of network behavior. However, such analysis can be confusing and misleading as there are many intrinsic properties for each network metric. Alternatively, Information Theory methods have gained the spotlight because of their ability to create a quantitative and robust characterization of such networks. In this work, we use two Information Theory quantifiers, namely Network Entropy and Network Fisher Information Measure, to analyzing those networks. Our approach detects non-trivial characteristics of complex networks such as the transition present in the Watts-Strogatz model from k-ring to random graphs; the phase transition from a disconnected to an almost surely connected network when we increase the linking probability of Erdős-Rényi model; distinct phases of scale-free networks when considering a non-linear preferential attachment, fitness, and aging features alongside the configuration model with a pure power-law degree distribution. Finally, we analyze the numerical results for real networks, contrasting our findings with traditional complex network methods. In conclusion, we present an efficient method that ignites the debate on network characterization.

SNAM

2016 ◽  
pp. 215-236 ◽  
Author(s):  
Bassant Youssef ◽  
Scott F. Midkiff ◽  
Mohamed R. M. Rizk
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Degree Distribution ◽  
Network Models ◽  
Small World ◽  
Clustering Coefficient ◽  
Network Nodes ◽  
Scale Free ◽  
Complex Network Models ◽  
Novel Model

Complex networks are characterized by having a scale-free power-law (PL) degree distribution, a small world phenomenon, a high average clustering coefficient, and the emergence of community structure. Most proposed models did not incorporate all of these statistical properties and neglected incorporating the heterogeneous nature of network nodes. Even proposed heterogeneous complex network models were not generalized for different complex networks. We define a novel aspect of node-heterogeneity which is the node connection standard heterogeneity. We introduce our novel model “settling node adaptive model” SNAM which reflects this new nodes' heterogeneous aspect. SNAM was successful in preserving PL degree distribution, small world phenomenon and high clustering coefficient of complex networks. A modified version of SNAM shows the emergence of community structure. We prove using mathematical analysis that networks generated using SNAM have a PL degree distribution.

scholarly journals Community Mining Algorithm Based on Structural Similarity

2018 ◽  
Vol 176 ◽  
pp. 03008
Author(s):  
Yaqiong Liu ◽  
Lu Wang ◽  
Guoqing Chen
Keyword(s):  
Community Structure ◽  
Social Network ◽  
Complex Networks ◽  
Structural Similarity ◽  
Edge Weight ◽  
Data Sets ◽  
Operation Speed ◽  
Mining Algorithm ◽  
Community Classification ◽  
Community Mining

In order to improve the efficiency of community mining algorithm and the accuracy of community classification, a community mining algorithm based on structural similarity is proposed in this paper. The algorithm uses the structural similarity as an edge weight to perform the operation of the loop deletion, and implements community merging for isolated nodes, thus improving the precision of community division. The algorithm is compared with GN and SSNCA algorithm in classic data sets such as Zachary network, football data and dolphin social network. The experimental results show that the algorithm can effectively detect the community structure in complex networks, and the accuracy of classification and operation speed are obviously improved.

Sign in / Sign up

Export Citation Format

Share Document