Related papers: Extended Scale-Free Networks
In this work we make an attempt to understand social networks from a mathematical viewpoint. In the first instance we consider a network where each node representing an individual can connect with a neighbouring node with a certain…
Scale-free networks are a recently developed approach to model the interactions found in complex natural and man-made systems. Such networks exhibit a power-law distribution of node link (degree) frequencies n(k) in which a small number of…
Recently it has been shown that a large variety of different networks have power-law (scale-free) distributions of connectivities. We investigate the robustness of such a distribution in discrete threshold networks under neutral evolution.…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…
We study the topology of e-mail networks with e-mail addresses as nodes and e-mails as links using data from server log files. The resulting network exhibits a scale-free link distribution and pronounced small-world behavior, as observed in…
We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us…
Watts and Strogatz [Nature 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the network behaves as a small-world. Here, we test the…
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…
Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…
Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…
We investigate scaling properties of human brain functional networks in the resting-state. Analyzing network degree distributions, we statistically test whether their tails scale as power-law or not. Initial studies, based on least-squares…
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], Schneider et al. proposed a new measure for network robustness and investigated optimal networks with respect to this quantity. For networks with a power-law degree…
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter $q$. We obtain the topological…
The scale-free (SF) structure that commonly appears in many complex networks is one of the hot topics related to social, biological, and information sciences. The self-organized generation mechanisms are expected to be useful for efficient…
Systems with lattice geometry can be renormalized exploiting their coordinates in metric space, which naturally define the coarse-grained nodes. By contrast, complex networks defy the usual techniques, due to their small-world character and…
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a…
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…
Although the ``scale-free'' literature is large and growing, it gives neither a precise definition of scale-free graphs nor rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many…