Related papers: Are Scale Free Networks Better?
A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their co-ordinates. Starting with $N$…
We study two kinds of weighted networks, weighted small-world (WSW) and weighted scale-free (WSF). The weight $w_{ij}$ of a link between nodes $i$ and $j$ in the network is defined as the product of endpoint node degrees; that is…
We study the nature of fitness landscapes of 'quenched' Kauffman's Boolean model with a scale-free network. We have numerically calculated the rugged fitness landscapes, the distributions, its tails, and the correlation between the fitness…
We present the distance matrix evolution for different types of networks: exponential, scale-free and classical random ones. Statistical properties of these matrices are discussed as well as topological features of the networks. Numerical…
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the…
The traffic in telephone networks is analyzed in this paper. Unlike the classical traffic analysis where call blockings are due to the limited channel capacity, we consider here a more realistic cause for call blockings which is due to the…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
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 study complex networks with weights, $w_{ij}$, associated with each link connecting node $i$ and $j$. The weights are chosen to be correlated with the network topology in the form found in two real world examples, (a) the world-wide…
We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) ~ k^-a, i.e. the probability of having k links outgoing from a site. In contrast to the diameter of regular…
Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find…
We propose and analyze a stochastic model which explains, analytically, the cutoff behavior of real scale-free networks previously modeled computationally by Amaral et al. [Proc. Natl. Acad. Sci. U.S.A. 97, 11149 (2000)] and others. We…
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…
Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both…
We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys.…
We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…
The problem of real-time processing is one of the most challenging current issues in computer sciences. Because of the large amount of data to be treated in a limited period of time, parallel and distributed systems are required, whose…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping,…
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…