Random graph models of social networks.

by: ME Newman, DJ Watts, SH Strogatz

Proc Natl Acad Sci U S A, Vol. 99 Suppl 1 (19 February 2002), pp. 2566-2572.

View FullText article

DOI, Pubmed, Hubmed

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

pdlug, balicea, anon_pl, cristinaalp, merazzle, jaspervoskuilen, mylit, ransombriggs, patrickhoefler

Find related articles with these CiteULike tags

cultural-evolution, graph, graph-theory, largenetworks, model, network, networks, networktheory, power-law, random, random-graph, small-world, social, socialnets, socialnetwork, social-network, socialnetworks, thesis

Abstract

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

@article{citeulike:691419, abstract = {We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.}, address = {Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA. mark@santafe.edu}, author = {Newman, M. E. and Watts, D. J. and Strogatz, S. H. }, citeulike-article-id = {691419}, doi = {10.1073/pnas.012582999}, issn = {0027-8424}, journal = {Proc Natl Acad Sci U S A}, keywords = {graph, model, network, random, social, socialnetwork}, month = {February}, pages = {2566--2572}, posted-at = {2007-12-03 22:31:37}, priority = {2}, title = {Random graph models of social networks.}, url = {http://dx.doi.org/10.1073/pnas.012582999}, volume = {99 Suppl 1}, year = {2002} }

RIS record

TY - JOUR ID - citeulike:691419 L3 - citeulike-article-id:691419 TI - Random graph models of social networks. JF - Proc Natl Acad Sci U S A VL - 99 Suppl 1 SP - 2566 EP - 2572 AD - Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA. mark@santafe.edu SN - 0027-8424 N2 - We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph. KW - graph KW - model KW - network KW - random KW - social KW - socialnetwork AU - Newman, ME AU - Watts, DJ AU - Strogatz, SH PY - 2002/02/19/ UR - http://dx.doi.org/10.1073/pnas.012582999 ER -

RIS BibTeX