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...

In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension. General networks with fractal or hierarchical...

In this paper the robustness of network synchronizability against random deletion of nodes, i.e. errors, in dynamical scale-free networks was studied. To this end, two measures of network synchronizability, namely, the eigenratio of the Laplacian and the order parameter quantifying the degree of...

An important property of networked systems is their robustness against removal of network nodes, through either random node failure or targeted attack. Although design methods have been proposed for creating, ab initio, a network that has optimal robustness according to a given measure, one is...

Recently there has been a tremendous interest in models of networks with a power-law distribution of degree—so-called “scale-free networks.” It has been observed that such networks, normally, have extremely short path-lengths, scaling logarithmically or slower with system size. As an...

Introducing utility to describe the attractions of nodes in this work, we propose and study a simple asymmetrical evolving network model, considering both preferential attachment and random (controlled by probability p). That is, the utility increment Δui≠Δuj when connecting node i to node...

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The...

The scale-free property and community structures of complex networks formed by local events have been studied theoretically, numerically, and empirically. We showed analytically and numerically that the degree distribution function P(k) of the local-world evolving network exhibits a crossover...

In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under the assumption of continuous degree, we first give the...

We consider a finite set S={x1,…,xr} and associate to each element xi a probability pi. We then form sequences (N-strings) by drawing at random N elements from S with respect to the probabilities assigned to them. Each N-string generates a network where the elements of S are represented as...