On the visualization of social and other scale-free networks

Yuntao Jia, Jared Hoberock, Michael Garland, John C Hart

Research output: Contribution to journalArticle

Abstract

This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while preserving component connectedness and other features (e.g. cliques) to more clearly reveal the network's underlying connection pathways. This simplification approach deterministically filters (instead of clustering) the graph to retain important node and edge semantics, and works both automatically and interactively. The improved graph filtering and layout is combined with a novel computer graphics anisotropic shading of the dense crisscrossing array of edges to yield a full social network and scale-free graph visualization system. Both quantitative analysis and visual results demonstrate the effectiveness of this approach.

Original languageEnglish (US)
Article number4658141
Pages (from-to)1285-1292
Number of pages8
JournalIEEE Transactions on Visualization and Computer Graphics
Volume14
Issue number6
DOIs
StatePublished - Nov 1 2008

Fingerprint

Complex networks
Computer graphics
Visualization
Semantics
Chemical analysis

Keywords

  • Anisotropic shading
  • Betweenness centrality
  • Edge filtering
  • Scale-free network

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

On the visualization of social and other scale-free networks. / Jia, Yuntao; Hoberock, Jared; Garland, Michael; Hart, John C.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 14, No. 6, 4658141, 01.11.2008, p. 1285-1292.

Research output: Contribution to journalArticle

Jia, Yuntao ; Hoberock, Jared ; Garland, Michael ; Hart, John C. / On the visualization of social and other scale-free networks. In: IEEE Transactions on Visualization and Computer Graphics. 2008 ; Vol. 14, No. 6. pp. 1285-1292.
@article{08ec17a065ef4d26b89edf0d4b00e631,
title = "On the visualization of social and other scale-free networks",
abstract = "This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while preserving component connectedness and other features (e.g. cliques) to more clearly reveal the network's underlying connection pathways. This simplification approach deterministically filters (instead of clustering) the graph to retain important node and edge semantics, and works both automatically and interactively. The improved graph filtering and layout is combined with a novel computer graphics anisotropic shading of the dense crisscrossing array of edges to yield a full social network and scale-free graph visualization system. Both quantitative analysis and visual results demonstrate the effectiveness of this approach.",
keywords = "Anisotropic shading, Betweenness centrality, Edge filtering, Scale-free network",
author = "Yuntao Jia and Jared Hoberock and Michael Garland and Hart, {John C}",
year = "2008",
month = "11",
day = "1",
doi = "10.1109/TVCG.2008.151",
language = "English (US)",
volume = "14",
pages = "1285--1292",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - On the visualization of social and other scale-free networks

AU - Jia, Yuntao

AU - Hoberock, Jared

AU - Garland, Michael

AU - Hart, John C

PY - 2008/11/1

Y1 - 2008/11/1

N2 - This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while preserving component connectedness and other features (e.g. cliques) to more clearly reveal the network's underlying connection pathways. This simplification approach deterministically filters (instead of clustering) the graph to retain important node and edge semantics, and works both automatically and interactively. The improved graph filtering and layout is combined with a novel computer graphics anisotropic shading of the dense crisscrossing array of edges to yield a full social network and scale-free graph visualization system. Both quantitative analysis and visual results demonstrate the effectiveness of this approach.

AB - This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while preserving component connectedness and other features (e.g. cliques) to more clearly reveal the network's underlying connection pathways. This simplification approach deterministically filters (instead of clustering) the graph to retain important node and edge semantics, and works both automatically and interactively. The improved graph filtering and layout is combined with a novel computer graphics anisotropic shading of the dense crisscrossing array of edges to yield a full social network and scale-free graph visualization system. Both quantitative analysis and visual results demonstrate the effectiveness of this approach.

KW - Anisotropic shading

KW - Betweenness centrality

KW - Edge filtering

KW - Scale-free network

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

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

U2 - 10.1109/TVCG.2008.151

DO - 10.1109/TVCG.2008.151

M3 - Article

C2 - 18988975

AN - SCOPUS:54949147226

VL - 14

SP - 1285

EP - 1292

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 6

M1 - 4658141

ER -