Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations.

نویسنده

  • Alexei Vázquez
چکیده

The linear preferential attachment hypothesis has been shown to be quite successful in explaining the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a general principle based on local rules. In this work it is claimed that an effective linear preferential attachment is the natural outcome of growing network models based on local rules. It is also shown that the local models offer an explanation for other properties like the clustering hierarchy and degree correlations recently observed in complex networks. These conclusions are based on both analytical and numerical results for different local rules, including some models already proposed in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Growing Hierarchical Scale-Free Networks by Means of Nonhierarchical Processes

We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degreedegree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional ...

متن کامل

Rate equation approach for correlations in growing network models.

We propose a rate equation approach to compute two vertex correlations in scale-free growing network models based on the preferential attachment mechanism. The formalism, based on previous work of Szabo [Phys. Rev. E. 67, 056102 (2002)] for the clustering spectrum, measuring three vertex correlations, is based on a rate equation in the continuous degree and time approximation for the average de...

متن کامل

Context dependent preferential attachment model for complex networks

In this paper, we propose a growing random complex network model, which we call context dependent preferential attachment model (CDPAM), when the preference of a new node to get attached to old nodes is determined by the local and global property of the old nodes. We consider that local and global properties of a node as the degree and relative average degree of the node respectively. We prove ...

متن کامل

Features and heterogeneities in growing network models

Many complex networks from the World Wide Web to biological networks grow taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document such as personal page, thematic website, news, blog, search engine, social network, etc., or the classification of a gene in a functional module. Moreover the feature o...

متن کامل

Assortativity and leadership emergence from anti-preferential attachment in heterogeneous networks

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 67 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2003