Related papers: Scale-free network growth by ranking
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…
Combinations of random and preferential growth for both on-growing and stationary networks are studied and a hierarchical topology is observed. Thus for real world scale-free networks which do not exhibit hierarchical features preferential…
We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this…
We derive mean-field equations that describe the dynamics of a general model of rumor spreading on complex networks, and use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model…
We consider a stochastic model for directed scale-free networks following power-laws in the degree distributions in both incoming and outgoing directions. In our model, the number of vertices grow geometrically with time with growth rate p.…
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as…
In this paper, a simply rule that generates scale-free networks with very large clustering coefficient and very small average distance is presented. These networks are called {\bf Multistage Random Growing Networks}(MRGN) as the adding…
Complex networks across various fields are often considered to be scale free -- a statistical property usually solely characterized by a power-law distribution of the nodes' degree $k$. However, this characterization is incomplete. In…
We demonstrate how sophisticated graph properties, such as small distances and scale-free degree distributions, arise naturally from a reinforcement mechanism on layered graphs. Every node is assigned an a-priori i.i.d. fitness with…
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…
Scale-free power law structure describes complex networks derived from a wide range of real world processes. The extensive literature focuses almost exclusively on networks with power law exponent strictly larger than 2, which can be…
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally…
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…
We offer an example of an network model with a power law degree distribution, P(k) ~ k^{-alpha}, for nodes but which nevertheless has a well-defined geography and a nonzero threshold percolation probability for alpha>2, the range of…
A key ingredient of current models proposed to capture the topological evolution of complex networks is the hypothesis that highly connected nodes increase their connectivity faster than their less connected peers, a phenomenon called…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
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…
In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…