Related papers: Scale-free networks without growth
We have analysed some structural properties of scale-free networks with the same degree distribution. Departing from a degree distribution obtained from the Barab\'asi-Albert (BA) algorithm, networks were generated using four additional…
We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the…
We use the configuration model to generate networks having a degree distribution that follows a $q$-exponential, $P_q(k)=(2-q)\lambda[1-(1-q)\lambda k]^{1/(q-1)}$, for arbitrary values of the parameters $q$ and $\lambda$. We study the…
Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all…
All crucial features of the recently observed real-world weighted networks are obtained in a model where the weight of a link is defined with a single non-linear parameter $\alpha$ as $w_{ij}=(s_is_j)^\alpha$, $s_i$ and $s_j$ are the…
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution…
Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…
Activity or spin patterns on random scale-free network are studied by mean field analysis and computer simulations. These activity patterns evolve in time according to local majority-rule dynamics which is implemented using (i) parallel or…
We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When…
Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and…
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…
Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…
Many naturally occurring networks have a power-law degree distribution as well as a non-zero degree correlation. Despite this, most studies analyzing the robustness to random node-deletion and vulnerability to targeted node-deletion have…
Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…
We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a…
The growth of an interface formed by the hierarchical deposition of particles of unequal size is studied in the framework of a dynamical network generated by a horizontal visibility algorithm. For a deterministic model of the deposition…
We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in an underlying similarity space and uses rewirings of the…
In this work, a growing network model that can generate a random network with finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in…
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…
Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explicated. We investigate the dynamic behaviors of resource/traffic flow on scale-free…