Small-world properties of facebook group networks

Jason Wohlgemuth, Mihaela Teodora Matache

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Small-world networks permeate modern society. In this paper we present a methodology for creating and analyzing a practically limitless number of networks exhibiting small-world network properties. More precisely, we analyze networks whose nodes are Facebook groups sharing a common word in the group name and whose links are mutual members in any two groups. By analyzing several numerical characteristics of single networks and network aggregations, we investigate how the small-world properties scale with a coarsening of the network. We show that Facebook group networks have small average path lengths and large clustering coefficients that do not vanish with increased network size, thus exhibiting small-world features. The degree distributions cannot be characterized completely by a power law, and the clustering coefficients are significantly larger than what would be expected for random networks, while the average shortest paths have consistently small values characteristic of random graphs. At the same time, the average connectivity increases as a power of the network size, while the average clustering coefficients and average path lengths do not exhibit a clear scaling with the size of the network. Our results are somewhat similar to what has been found in previous studies of the networks of individual Facebook users.

Original languageEnglish (US)
Pages (from-to)197-225
Number of pages29
JournalComplex Systems
Volume23
Issue number3
StatePublished - Jan 1 2014

Fingerprint

Small-world networks
Coarsening
Agglomeration

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Small-world properties of facebook group networks. / Wohlgemuth, Jason; Matache, Mihaela Teodora.

In: Complex Systems, Vol. 23, No. 3, 01.01.2014, p. 197-225.

Research output: Contribution to journalArticle

Wohlgemuth, J & Matache, MT 2014, 'Small-world properties of facebook group networks', Complex Systems, vol. 23, no. 3, pp. 197-225.
Wohlgemuth, Jason ; Matache, Mihaela Teodora. / Small-world properties of facebook group networks. In: Complex Systems. 2014 ; Vol. 23, No. 3. pp. 197-225.
@article{ce2c406e54284ce58a2e8ee58c629b4a,
title = "Small-world properties of facebook group networks",
abstract = "Small-world networks permeate modern society. In this paper we present a methodology for creating and analyzing a practically limitless number of networks exhibiting small-world network properties. More precisely, we analyze networks whose nodes are Facebook groups sharing a common word in the group name and whose links are mutual members in any two groups. By analyzing several numerical characteristics of single networks and network aggregations, we investigate how the small-world properties scale with a coarsening of the network. We show that Facebook group networks have small average path lengths and large clustering coefficients that do not vanish with increased network size, thus exhibiting small-world features. The degree distributions cannot be characterized completely by a power law, and the clustering coefficients are significantly larger than what would be expected for random networks, while the average shortest paths have consistently small values characteristic of random graphs. At the same time, the average connectivity increases as a power of the network size, while the average clustering coefficients and average path lengths do not exhibit a clear scaling with the size of the network. Our results are somewhat similar to what has been found in previous studies of the networks of individual Facebook users.",
author = "Jason Wohlgemuth and Matache, {Mihaela Teodora}",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
volume = "23",
pages = "197--225",
journal = "Complex Systems",
issn = "0891-2513",
publisher = "Complex Systems Publications, inc.",
number = "3",

}

TY - JOUR

T1 - Small-world properties of facebook group networks

AU - Wohlgemuth, Jason

AU - Matache, Mihaela Teodora

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Small-world networks permeate modern society. In this paper we present a methodology for creating and analyzing a practically limitless number of networks exhibiting small-world network properties. More precisely, we analyze networks whose nodes are Facebook groups sharing a common word in the group name and whose links are mutual members in any two groups. By analyzing several numerical characteristics of single networks and network aggregations, we investigate how the small-world properties scale with a coarsening of the network. We show that Facebook group networks have small average path lengths and large clustering coefficients that do not vanish with increased network size, thus exhibiting small-world features. The degree distributions cannot be characterized completely by a power law, and the clustering coefficients are significantly larger than what would be expected for random networks, while the average shortest paths have consistently small values characteristic of random graphs. At the same time, the average connectivity increases as a power of the network size, while the average clustering coefficients and average path lengths do not exhibit a clear scaling with the size of the network. Our results are somewhat similar to what has been found in previous studies of the networks of individual Facebook users.

AB - Small-world networks permeate modern society. In this paper we present a methodology for creating and analyzing a practically limitless number of networks exhibiting small-world network properties. More precisely, we analyze networks whose nodes are Facebook groups sharing a common word in the group name and whose links are mutual members in any two groups. By analyzing several numerical characteristics of single networks and network aggregations, we investigate how the small-world properties scale with a coarsening of the network. We show that Facebook group networks have small average path lengths and large clustering coefficients that do not vanish with increased network size, thus exhibiting small-world features. The degree distributions cannot be characterized completely by a power law, and the clustering coefficients are significantly larger than what would be expected for random networks, while the average shortest paths have consistently small values characteristic of random graphs. At the same time, the average connectivity increases as a power of the network size, while the average clustering coefficients and average path lengths do not exhibit a clear scaling with the size of the network. Our results are somewhat similar to what has been found in previous studies of the networks of individual Facebook users.

UR - http://www.scopus.com/inward/record.url?scp=84921261862&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921261862&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84921261862

VL - 23

SP - 197

EP - 225

JO - Complex Systems

JF - Complex Systems

SN - 0891-2513

IS - 3

ER -