Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2006 · 15 citations · 14 references
ComputingVisualizationData VisualizationGraph VisualizationInformation VisualizationFocus TechniquesGraph AlgorithmsGraph DrawingGraph MiningGraph TheorySmall-world NetworksDegree DistributionFilteringGraph ProcessingNode Degree DistributionPower-law Degree DistributionPower-law DistributionsPower-law ModelSmall-world Graph Drawing
Realistic interaction networks usually present two main properties: a power-law degree distribution and a small world behavior. Few nodes are linked to many nodes and adjacent nodes are likely to share common neighbors. Moreover, graph structure usually presents a dense core that is difficult to explore with classical filtering and clustering techniques. In this paper, we propose a new filtering technique accounting for a user-focus. This technique extracts a tree-like graph with also power-law degree distribution and small world behavior. Resulting structure is easily drawn with classical force-directed drawing algorithms. It is also quickly clustered and displayed into a multi-level silhouette tree (MuSi-Tree) from any user-focus. We built a new graph filtering + clustering + drawing API and report a case study.
14
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
A faster algorithm for betweenness centrality*
Ulrik Brandes · Journal of Mathematical Sociology · 2001 · 4.9K citations · Full text