Related papers: Degree-distribution stability of scale-free networ…
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random…
Many networks generated by nature have two generic properties: they are formed in the process of {preferential attachment} and they are scale-free. Considering these features, by interfering with mechanism of the {preferential attachment},…
The reliability of electric transmission systems is examined using a scale-free model of network structure and failure propagation. The topologies of the North American eastern and western electric networks are analyzed to estimate their…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
Extending previous results in the literature, random colored substitution networks and degree dimension are defined in this paper. The scale-freeness of these networks is proved by introducing a new definition for degree dimension that is…
This paper presents the development of a new class of algorithms that accurately implement the preferential attachment mechanism of the Barab\'asi-Albert (BA) model to generate scale-free graphs. Contrary to existing approximate…
In many networks of scientific interest we know that the link between any pair of vertices conforms to a specific probability, such as the link probability in the Barab\'asi-Albert scale-free networks. Here we demonstrate how the…
Networks with a scale-free degree distribution are widely thought to promote cooperation in various games. Herein, by studying the well-known prisoner's dilemma game, we demonstrate that this need not necessarily be true. For the very same…
A recent paper "Emergence of scaling in random networks" (cond-mat/9910332) by Barabasi and Albert proposes a growth mechanism to produce a stationary scale free distribution of the number of edges per node in large networks such as the…
Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…
A Barab\'asi-Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring…
We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…
A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being…
For downward skip-free continuous-time Markov chains on non-negative integers stopped at zero, existence of a quasi-stationary distribution is studied. The scale function for these processes is introduced and the boundary is classified by a…
Using a mean-field network formulation of the Bass innovation diffusion model and exact results by Fotouhi and Rabbat on the degree correlations of Barabasi-Albert networks, we compute the times of the diffusion peak and compare them with…
We consider a flow-level model of a network operating under an $\alpha$-fair bandwidth sharing policy (with $\alpha>0$) proposed by Roberts and Massouli\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that…
Discovery of a new scale-free law of earthquake phenomenon is reported. It is relevant to the structural and dynamical properties of the earthquake network proposed in a recent work [S. Abe and N. Suzuki, Europhys. Lett. 65, 581 (2004)].…
Many biological networks have been labelled scale-free as their degree distribution can be approximately described by a powerlaw distribution. While the degree distribution does not summarize all aspects of a network it has often been…