Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2621934.2621942acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
tutorial

How community-like is the structure of synthetically generated graphs?

Published: 22 June 2014 Publication History

Abstract

Social-like graph generators have become an indispensable tool when designing proper evaluation methodologies for social graph applications, algorithms and systems. Existing synthetic generators have been designed to produce data with characteristics similar to those found in real graphs, such as power-law degree distributions, a large clustering coefficient or a small diameter. However, real social networks are organized into higher level structures, called communities, that are not explicitly considered by these generators. In this paper, we study the statistical features of the community structure found in real social networks, and compare them to those generated by the LFR and LDBC-DG generators. We found that communities show multimodal features, and thus are hard to generate with simple community models. According to our results LDBC-DG draws realistic community distributions, even reproducing the multimodality observed.

References

[1]
Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. R-mat: A recursive model for graph mining. In SDM, volume 4, pages 442--446. SIAM, 2004.
[2]
Marek Ciglan, Michal Laclavik, and Kjetil Nørvåg. On community detection in real-world networks and the importance of degree assortativity. In KDD, pages 1007--1015, 2013.
[3]
Renzo et al. The linked data benchmark council: a graph and rdf industry benchmarking effort. In To appear in SIGMOD Record. ACM.
[4]
Myunghwan Kim and Jure Leskovec. Multiplicative attribute graph model of real-world networks. Internet Mathematics, 8(1-2):113--160, 2012.
[5]
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. Benchmark graphs for testing community detection algorithms. Phy. Rev. E, 78(4):046110, 2008.
[6]
Günce Keziban Orman and Vincent Labatut. A comparison of community detection algorithms on artificial networks. In Discovery Science, pages 242--256. Springer, 2009.
[7]
Minh-Duc Pham, Peter Boncz, and Orri Erling. S3g2: A scalable structure-correlated social graph generator. In TPCTC, pages 156--172. Springer, 2012.
[8]
Jaewon Yang and Jure Leskovec. Defining and evaluating network communities based on ground-truth. In MDS, page 3. ACM, 2012.
[9]
Jaewon Yang and Jure Leskovec. Overlapping community detection at scale: a nonnegative matrix factorization approach. In WSDM, pages 587--596. ACM, 2013.

Cited By

View all
  • (2020)Graph GeneratorsACM Computing Surveys10.1145/337944553:2(1-30)Online publication date: 17-Apr-2020
  • (2020) R 3 MAT: A Rapid and Robust Graph Generator IEEE Access10.1109/ACCESS.2020.30095778(130048-130065)Online publication date: 2020
  • (2018)An early look at the LDBC social network benchmark's business intelligence workloadProceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3210259.3210268(1-11)Online publication date: 10-Jun-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and Systems
June 2014
79 pages
ISBN:9781450329828
DOI:10.1145/2621934
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2014

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Tutorial
  • Research
  • Refereed limited

Conference

SIGMOD/PODS'14
Sponsor:

Acceptance Rates

Overall Acceptance Rate 29 of 61 submissions, 48%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Graph GeneratorsACM Computing Surveys10.1145/337944553:2(1-30)Online publication date: 17-Apr-2020
  • (2020) R 3 MAT: A Rapid and Robust Graph Generator IEEE Access10.1109/ACCESS.2020.30095778(130048-130065)Online publication date: 2020
  • (2018)An early look at the LDBC social network benchmark's business intelligence workloadProceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3210259.3210268(1-11)Online publication date: 10-Jun-2018
  • (2018)Exploring HPC and Big Data Convergence: A Graph Processing Study on Intel Knights Landing2018 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER.2018.00019(66-77)Online publication date: Sep-2018
  • (2017)Towards a property graph generator for benchmarkingProceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems10.1145/3078447.3078453(1-6)Online publication date: 19-May-2017
  • (2015)GraphalyticsProceedings of the GRADES'1510.1145/2764947.2764954(1-6)Online publication date: 31-May-2015
  • (2015)The LDBC Social Network BenchmarkProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2742786(619-630)Online publication date: 27-May-2015

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media