%0 Journal Article %1 ToivonenKovanen:2009 %A Toivonen, Riitta %A Kovanen, Lauri %A Kiveläa, Mikko %A Onnela, Jukka-Pekka %A Saramäki, Jari %A Kaski, Kimmo %D 2009 %J Social Networks %K complexity methodology network-analysis social theory %N 3 %T A Comparative Study of Social Network Models: Network Evolution Models and Nodal Attribute Models %V 31 %X This paper reviews, classifies and compares recent models for social networks that have mainly been published within the physics-oriented complex networks literature. The models fall into two categories: those in which the addition of new links is dependent on the (typically local) network structure ( network evolution models , NEMs), and those in which links are generated based only on nodal attributes ( nodal attribute models , NAMs). An exponential random graph model (ERGM) with structural dependencies is included for comparison. We fit models from each of these categories to two empirical acquaintance networks with respect to basic network properties. We compare higher order structures in the resulting networks with those in the data, with the aim of determining which models produce the most realistic network structure with respect to degree distributions, assortativity, clustering spectra, geodesic path distributions, and community structure (subgroups with dense internal connections). We find that the nodal attribute models successfully produce assortative networks and very clear community structure. However, they generate unrealistic clustering spectra and peaked degree distributions that do not match empirical data on large social networks. On the other hand, many of the network evolution models produce degree distributions and clustering spectra that agree more closely with data. They also generate assortative networks and community structure, although often not to the same extent as in the data. The ERGM model, which turned out to be near-degenerate in the parameter region best fitting our data, produces the weakest community structure.

@article{ToivonenKovanen:2009, abstract = {This paper reviews, classifies and compares recent models for social networks that have mainly been published within the physics-oriented complex networks literature. The models fall into two categories: those in which the addition of new links is dependent on the (typically local) network structure ( network evolution models , NEMs), and those in which links are generated based only on nodal attributes ( nodal attribute models , NAMs). An exponential random graph model (ERGM) with structural dependencies is included for comparison. We fit models from each of these categories to two empirical acquaintance networks with respect to basic network properties. We compare higher order structures in the resulting networks with those in the data, with the aim of determining which models produce the most realistic network structure with respect to degree distributions, assortativity, clustering spectra, geodesic path distributions, and community structure (subgroups with dense internal connections). We find that the nodal attribute models successfully produce assortative networks and very clear community structure. However, they generate unrealistic clustering spectra and peaked degree distributions that do not match empirical data on large social networks. On the other hand, many of the network evolution models produce degree distributions and clustering spectra that agree more closely with data. They also generate assortative networks and community structure, although often not to the same extent as in the data. The ERGM model, which turned out to be near-degenerate in the parameter region best fitting our data, produces the weakest community structure.}, added-at = {2010-03-02T17:25:53.000+0100}, author = {Toivonen, Riitta and Kovanen, Lauri and Kivel{\"a}a, Mikko and Onnela, Jukka-Pekka and Saram{\"a}ki, Jari and Kaski, Kimmo}, bdsk-url-1 = {http://dx.doi.org/10.1016/j.socnet.2009.06.004}, biburl = {https://www.bibsonomy.org/bibtex/2cd2ff082efbcd81881d7867717160fc7/jrennstich}, citeulike-article-id = {5229797}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.socnet.2009.06.004}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0378873309000331}, date-added = {2009-07-22 12:01:32 -0400}, date-modified = {2010-02-28 21:03:37 -0500}, interhash = {442832bac93faee6a073ea26fcd7d098}, intrahash = {cd2ff082efbcd81881d7867717160fc7}, issn = {03788733}, journal = {Social Networks}, keywords = {complexity methodology network-analysis social theory}, month = Jul, number = 3, priority = {2}, timestamp = {2010-03-05T16:46:29.000+0100}, title = {A Comparative Study of Social Network Models: Network Evolution Models and Nodal Attribute Models}, volume = 31, year = 2009 }