Related papers: Weighted Scale-free Networks in Euclidean Space Us…
We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to ends of preferentially chosen weighted edges. Resulting…
Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
It has been discovered recently that many social, biological and ecological systems have the so-called small-world and scale-free features, which has provoked new research interest in the studies of various complex networks. Yet, most…
We introduce a new mechanism of connectivity evolution in networks to account for the emergence of scale-free behavior. The mechanism works on a fixed set of nodes and promotes growth from a minimally connected initial topology by the…
The scale-free model of Barabasi and Albert gave rise to a burst of activity in the field of complex networks. In this paper, we revisit one of the main assumptions of the model, the preferential attachment rule. We study a model in which…
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of…
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…
We discuss three related models of scale-free networks with the same degree distribution but different correlation properties. Starting from the Barabasi-Albert construction based on growth and preferential attachment we discuss two other…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barab\'{a}si and Albert where a network is generated iteratively from a small seed…
We study the detailed epidemic spreading process in scale-free networks with weight that denote familiarity between two people or computers. The result shows that spreading velocity reaches a peak quickly then decays representing power-law…
The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent $\beta$.…
Many realistic networks are scale-free, with small characteristic path lengths, high clustering, and power law in their degree distribution. They can be obtained by dynamical networks in which a preferential attachment process takes place.…
Identifying power-law scaling in real networks - indicative of preferential attachment - has proved controversial. Critics argue that measuring the temporal evolution of a network directly is better than measuring the degree distribution…
Many biological, ecological and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most network models studied so far are binary, the link strength being either 0…
Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks…
We study the statistics of growing networks in which each link carries a weight (k_i k_j)^theta, where k_i and k_j are the node degrees at the endpoints of link ij. Network growth is governed by preferential attachment in which a…