Related papers: Scale-free networks with exponent one

Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…

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…

The impact of inhomogeneous arrangement of nodes in space on network organization cannot be neglected in most of real-world scale-free networks. Here, we wish to suggest a model for a geographical network with nodes embedded in a fractal…

Many real networks have cliques as their constitutional units. Here we present a family of scale-free network model consist of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and…

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 show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1,…

In this paper, we analyze the behavior of the global clustering coefficient in scale free graphs. We are especially interested in the case of degree distribution with an infinite variance, since such degree distribution is usually observed…

The degree distribution is a key statistical indicator in network theory, often used to understand how information spreads across connected nodes. In this paper, we focus on non-growing networks formed through a rewiring algorithm and…

Real-life networks often encounter vertex dysfunctions, which are usually followed by recoveries after appropriate maintenances. In this paper we present our research on a model of scale-free networks whose vertices are regularly removed…

Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…

Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…

Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…

The degree distributions of many real world networks follow power-laws whose exponents tend to fall between two and three. Within the framework of the Barabasi-Albert model (BA model), we explain this empirical observation by a simple fact.…

We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we show that for a particular type of structure…

Very often, when studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree-degree correlations are not present. However, simple constraints, such as the absence of multiple edges and…

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,…

We analyze about two hundred naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned…

This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…

It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in…

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…