Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A generative model for sparse, evolving digraphs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2018 (English)In: 6th International Conference on Complex Networks and Their Applications, Complex Networks 2017, Springer, 2018, Vol. 689, p. 531-542Conference paper (Refereed)
Abstract [en]

Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs similar to real ones. Since real graphs are evolving and this evolution is important to study in order to understand the underlying dynamical system, we tackle the problem of generating series of graphs. We propose SEDGE, an algorithm meant to generate series of graphs similar to a real series. SEDGE is an extension of SDG. We consider graphs that are representations of software programs and show experimentally that our approach outperforms other existing approaches. Experiments show the performance of both algorithms.

Place, publisher, year, edition, pages
Springer, 2018. Vol. 689, p. 531-542
Series
Studies in Computational Intelligence, ISSN 1860-949X ; 689
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-220199DOI: 10.1007/978-3-319-72150-7_43Scopus ID: 2-s2.0-85036642634ISBN: 9783319721491 (print)OAI: oai:DiVA.org:kth-220199DiVA, id: diva2:1167092
Conference
6th International Conference on Complex Networks and Their Applications, Complex Networks 2017, Lyon, France, 29 November 2017 through 1 December 2017
Note

QC 20171218

Available from: 2017-12-18 Created: 2017-12-18 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Monperrus, Martin

Search in DiVA

By author/editor
Monperrus, Martin
By organisation
Theoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1453 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf