Generating and analyzing spatial social networks

被引:0
|
作者
Meysam Alizadeh
Claudio Cioffi-Revilla
Andrew Crooks
机构
[1] George Mason University,Computational Social Science Program, Department of Computational and Data Sciences
[2] George Mason University,Center for Social Complexity, Krasnow Institute for Advanced Studies
关键词
Spatial social networks; Network properties; Random network; Small-world network; Scale-free network;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we propose a class of models for generating spatial versions of three classic networks: Erdös-Rényi (ER), Watts-Strogatz (WS), and Barabási-Albert (BA). We assume that nodes have geographical coordinates, are uniformly distributed over an m × m Cartesian space, and long-distance connections are penalized. Our computational results show higher clustering coefficient, assortativity, and transitivity in all three spatial networks, and imperfect power law degree distribution in the BA network. Furthermore, we analyze a special case with geographically clustered coordinates, resembling real human communities, in which points are clustered over k centers. Comparison between the uniformly and geographically clustered versions of the proposed spatial networks show an increase in values of the clustering coefficient, assortativity, and transitivity, and a lognormal degree distribution for spatially clustered ER, taller degree distribution and higher average path length for spatially clustered WS, and higher clustering coefficient and transitivity for the spatially clustered BA networks.
引用
收藏
页码:362 / 390
页数:28
相关论文
共 50 条