Highly clustered scale-free networks
نویسندگان
چکیده
منابع مشابه
Highly clustered scale-free networks.
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the...
متن کاملEnhancement of cooperation in highly clustered scale-free networks.
We study the effect of clustering on the organization of cooperation by analyzing the evolutionary dynamics of the "Prisoner's Dilemma" on scale-free networks with a tunable value of clustering. We find, on the one hand, that a high value of the clustering coefficient produces an overall enhancement of cooperation in the network, even for a very high temptation to defect. On the other hand, hig...
متن کاملProperties of highly clustered networks.
We propose and solve exactly a model of a network that has both a tunable degree distribution and a tunable clustering coefficient. Among other things, our results indicate that increased clustering leads to a decrease in the size of the giant component of the network. We also study susceptible/infective/recovered type epidemic processes within the model and find that clustering decreases the s...
متن کاملComment on "properties of highly clustered networks".
We consider a procedure for generating clustered networks previously reported by Newman [Phys. Rev. E 68, 026121 (2003)]. In the same study, clustered networks generated according to the proposed model have been reported to have a lower epidemic threshold under susceptible-infective-recovered-type network epidemic dynamics. By rewiring networks generated by this model, such that the degree dist...
متن کاملExactly scale-free scale-free networks
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.65.036123