A Model for Social Networks
R. Toivonen, J. -P. Onnela, J. Saramäki, J. Hyvönen, K. Kaski
Abstract
Social networks are organized into communities with dense internal connections, giving rise to high values of the clustering coefficient. In addition, these networks have been observed to be assortative, i.e. highly connected vertices tend to connect to other highly connected vertices, and have broad degree distributions. We present a model for an undirected growing network which reproduces these characteristics, with the aim of producing efficiently very large networks to be used as platforms for studying sociodynamic phenomena. The communities arise from a mixture of random attachment and implicit preferential attachment. The structural properties of the model are studied analytically and numerically, using the k-clique method for quantifying the communities.
Create a lesson
Related papers
Distinct routes to phase transitions in spatial activation systems
Jialu Zhang, Guanyu Zhang, Leyang Xue et al.
District-Level Food Environment Indicators and Social Vulnerability in São Paulo
Pedro Lemes Sixel Lobo, Eric Tokuda, Kuruvilla Joseph Abraham et al.
Prompt Sensitivity of Generative Agents: Evidence from an Epidemic Model
Ross Williams, Niyousha Hosseinichimeh
Giant strongly biconnected components of directed networks: a generating function approach
Minsoo Yang, Reinhard Laubenbacher, Byungjoon Min
(k,n)-core percolation on hypergraphs with anchor nodes
Hoseung Jang, Byungjoon Min, Ginestra Bianconi
The complex relationship between anti-immigrant sentiment and exposure in the Netherlands
Benedikt Meylahn, Tommaso Giommoni, Mike Lees et al.