Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Blesa, Maria J.; Popa, Mihail Eduard; Serna, Maria https://www.dagstuhl.de/lipics License: Creative Commons Attribution 4.0 license (CC BY 4.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-165410
URL:

; ;

Relating Real and Synthetic Social Networks Through Centrality Measures

pdf-format:


Abstract

We perform here a comparative study on the behaviour of real and synthetic social networks with respect to a selection of nine centrality measures. Some of them are topology based (degree, closeness, betweenness), while others consider the relevance of the actors within the network (Katz, PageRank) or their ability to spread influence through it (Independent Cascade rank, Linear Threshold Rank). We run different experiments on synthetic social networks, with 1K, 10K, and 100K nodes, generated according to the Gaussian Random partition model, the stochastic block model, the LFR benchmark graph model and hyperbolic geometric graphs model. Some real social networks are also considered, with the aim of discovering how do they relate to the synthetic models in terms of centrality. Apart from usual statistical measures, we perform a correlation analysis between all the nine measures. Our results indicate that, in general, the correlation matrices of the different models scale nicely with size. Moreover, the correlation plots distinguish four categories that classify most of the real networks studied here. Those categories have a clear correspondence with particular configurations of the models for synthetic networks.

BibTeX - Entry

@InProceedings{blesa_et_al:LIPIcs.SEA.2022.7,
  author =	{Blesa, Maria J. and Popa, Mihail Eduard and Serna, Maria},
  title =	{{Relating Real and Synthetic Social Networks Through Centrality Measures}},
  booktitle =	{20th International Symposium on Experimental Algorithms (SEA 2022)},
  pages =	{7:1--7:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-251-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{233},
  editor =	{Schulz, Christian and U\c{c}ar, Bora},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16541},
  URN =		{urn:nbn:de:0030-drops-165410},
  doi =		{10.4230/LIPIcs.SEA.2022.7},
  annote =	{Keywords: centrality measures, influence spread models, synthetic social networks}
}

Keywords: centrality measures, influence spread models, synthetic social networks
Seminar: 20th International Symposium on Experimental Algorithms (SEA 2022)
Issue date: 2022
Date of publication: 11.07.2022
Supplementary Material: Other (Experimental Results): https://www.cs.upc.edu/~mjblesa/centrality/syntheticGraphs/


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI