Evolutionary game on networks with high clustering coefficient
نویسندگان
چکیده
منابع مشابه
Evolutionary game on networks with high clustering coefficient
Abstract This study investigates the influence of lattice structure in evolutionary games. The snowdrift games is considered in networks with high clustering coefficients, that use four different strategyupdating. Analytical conjectures using pair approximation were compared with the numerical results. Results indicate that general statements asserting that the lattice structure enhances cooper...
متن کاملA Clustering Coefficient Network Formation Game
Social and other networks have been shown empirically to exhibit high edge clustering—that is, the density of local neighborhoods, as measured by the clustering coefficient, is often much larger than the overall edge density of the network. In social networks, a desire for tightknit circles of friendships — the colloquial “social clique” — is often cited as the primary driver of such structure....
متن کاملThe ensemble clustering with maximize diversity using evolutionary optimization algorithms
Data clustering is one of the main steps in data mining, which is responsible for exploring hidden patterns in non-tagged data. Due to the complexity of the problem and the weakness of the basic clustering methods, most studies today are guided by clustering ensemble methods. Diversity in primary results is one of the most important factors that can affect the quality of the final results. Also...
متن کاملClustering Coefficient Queries on Massive Dynamic Social Networks
The Clustering Coefficient (CC) is a fundamental measure in social network analysis assessing the degree to which nodes tend to cluster together. While CC computation on static graphs is well studied, emerging applications have new requirements for online query of the “global” CC of a given subset of a graph. As social networks are widely stored in databases for easy updating and accessing, com...
متن کاملNovel model of social networks with tunable clustering coefficient
We propose a novel method to generate scale-free networks with discretely tunable clustering coefficient in order to model real social networks. Recently several methods were introduced to generate networks with power law degree distribution. Most of them are based on preferential attachment, but in these networks the average clustering coefficient is low opposite to the real social networks. B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Theory and Its Applications, IEICE
سال: 2016
ISSN: 2185-4106
DOI: 10.1587/nolta.7.110