Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks

Thumbnail Image
Date
2015
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Journal article
Publication status
Published
Published in
Journal of Graph Algorithms and Applications : JGAA ; 19 (2015), 2. - pp. 595-618. - eISSN 1526-1719
Abstract
Small-world graphs have characteristically low average distance and thus cause force-directed methods to generate drawings that look like hairballs. This is by design as the inherent objective of these methods is a globally uniform edge length or, more generally, accurate distance representation. The problem arises, for instance, with graphs of high density or high conductance, or in the presence of high-degree vertices, all of which tend to pull vertices together and thus result in clutter overspreading variation in local density. We here propose a method specifically for a class of small-world graphs that are typical for online social networks. The method is based on a spanning subgraph that is sparse but connected and consists of strong ties holding together communities. To identify these ties we propose a novel criterion for structural embeddedness. It is based on a weighted accumulation of triangles in quadrangles and can be determined efficiently. An evaluation on empirical and generated networks indicates that our approach improves upon previous methods using other edge indices. Although primarily designed to achieve more informative drawings, our spanning subgraph may also serve as a sparsifier that trims a small-world graph prior to the application of a clustering algorithm.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690NOCAJ, Arlind, Mark ORTMANN, Ulrik BRANDES, 2015. Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks. In: Journal of Graph Algorithms and Applications : JGAA. 19(2), pp. 595-618. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00370
BibTex
@article{Nocaj2015Untan-32889,
  year={2015},
  doi={10.7155/jgaa.00370},
  title={Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks},
  number={2},
  volume={19},
  journal={Journal of Graph Algorithms and Applications : JGAA},
  pages={595--618},
  author={Nocaj, Arlind and Ortmann, Mark and Brandes, Ulrik}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/32889">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2015</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/32889"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/32889/3/Brandes_0-311019.pdf"/>
    <dcterms:title>Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Nocaj, Arlind</dc:contributor>
    <dc:creator>Ortmann, Mark</dc:creator>
    <dc:creator>Nocaj, Arlind</dc:creator>
    <dcterms:abstract xml:lang="eng">Small-world graphs have characteristically low average distance and thus cause force-directed methods to generate drawings that look like hairballs. This is by design as the inherent objective of these methods is a globally uniform edge length or, more generally, accurate distance representation. The problem arises, for instance, with graphs of high density or high conductance, or in the presence of high-degree vertices, all of which tend to pull vertices together and thus result in clutter overspreading variation in local density. We here propose a method specifically for a class of small-world graphs that are typical for online social networks. The method is based on a spanning subgraph that is sparse but connected and consists of strong ties holding together communities. To identify these ties we propose a novel criterion for structural embeddedness. It is based on a weighted accumulation of triangles in quadrangles and can be determined efficiently. An evaluation on empirical and generated networks indicates that our approach improves upon previous methods using other edge indices. Although primarily designed to achieve more informative drawings, our spanning subgraph may also serve as a sparsifier that trims a small-world graph prior to the application of a clustering algorithm.</dcterms:abstract>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/32889/3/Brandes_0-311019.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:language>eng</dc:language>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Ortmann, Mark</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-02-05T10:19:03Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-02-05T10:19:03Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed