Related papers: Scale-free network on a vertical plane

We analyze the degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…

Scale-free networks with small power law exponent are known to be robust, meaning that their qualitative topological structure cannot be altered by random removal of even a large proportion of nodes. By contrast, it has been argued in the…

We obtain closed form expressions for the expected conditional degree distribution and the joint degree distribution of the linear preferential attachment model for network growth in the steady state. We consider the multiple-destination…

We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…

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…

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…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics that make them…

The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…

We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks…

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…

Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski…

We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…

In a previous Letter (cond-mat/0106565), Goh et al have presented a numerical study of the load--or betweenness centrality--distribution in a scale-free network whose degree distribution follows a power law with a tunable exponent $\gamma$.…

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…

Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…

We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the…

We show that there are two classes of finite size effects for dynamic models taking place on a scale-free topology. Some models in finite networks show a behavior that depends only on the system size N. Others present an additional distinct…

We consider the discrete surface growth process with relaxation to the minimum [F. Family, J. Phys. A {\bf 19} L441, (1986).] as a possible synchronization mechanism on scale-free networks, characterized by a degree distribution $P(k) \sim…

Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…