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

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

The database of microRNAs and their predicted target genes in humans were used to extract a microRNA co-target network. Based on the finding that more than two miRNAs can target the same gene, we constructed a microRNA co-target network and analyzed it from the perspective of the complex...

We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the co-evolution of topology and weight. Considering the fluctuations in traffic flow constitute a main reason for congestion of packet delivery and poor performance of communication networks,...

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

A model of nongrowing networks with time-cumulative scale-free (SF) property based on the apply–reply process is proposed in this paper. This model is not only without growth but also without a direct expression of preferential attachment. The network structure is evolved by the change of...

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