We propose an extended local-world evolving network model including a triad formation (TF) step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree distribution, clustering coefficient and average path...

We propose a general geometric growth model for pseudofractal scale-free web (PSW), which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree distribution, degree correlations, distribution of...

We propose a simple algorithm which produces a new category of networks, high-dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension...

In this paper, adopting the initial load of a node i to be akiα with ki being the degree of the node i, we propose a cascading model based on a load local redistribution rule and examine cascading failures on the typical network, i.e., the BA network with the scale-free property. We find that...

Community structure discovery in complex networks is a popular issue, and overlapping community structure discovery in academic research has become one of the hot spots. Based on the Gaussian kernel similarity matrix and spectral bisection, this paper proposes a new community structure discovery...

Network's resilience to the malfunction of its components has been of great concern. The goal of this work is to determine the network design guidelines, which maximizes the network efficiency while keeping the cost of the network (that is the average connectivity) constant. With a global...

Detecting evolutionary community structure in dynamic weighted networks is important for understanding the structure and functions of networks. In this paper, an algorithm which considers the historic community structure of networks is developed to detect evolutionary community structure in...

Many networks are characterized by highly heterogeneous distributions of links which are called scale-free networks, and the degree distributions follow p(k)∼ck-α. We study the robustness of scale-free networks to random failures from the character of their heterogeneity. Entropy of the...