Modularity clustering is force-directed layout

Abstract

Two natural and widely used representations for the community structure of networks are clusterings, which partition the vertex set into disjoint subsets, and layouts, which assign the vertices to positions in a metric space. This paper unifies prominent characterizations of layout quality and clustering quality, by showing that energy models of pairwise attraction and repulsion subsume Newman and Girvan's modularity measure. Layouts with optimal energy are relaxations of, and are thus consistent with, clusterings with optimal modularity, which is of practical relevance because both representations are complementary and often used together.

9 pages, 7 figures, see http://code.google.com/p/linloglayout/ for downloading the graph clustering and layout software

References in corpus (11)

• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• Resolution limit in community detection
• Comparing community structure identification
• Analysis of weighted networks
• Statistical Mechanics of Community Detection
• Community structure in directed networks
• Modularity and community detection in bipartite networks
• Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement

Cited by in corpus (26)

• Community detection in graphs
• Stochastic epidemics in a homogeneous community
• Statistical inference for epidemic processes in a homogeneous community (Part IV of the book Stochastic Epidemic Models and Inference)
• Stochastic epidemics in a heterogeneous community (Part III of the book Stochastic Epidemic Models and Inference)
• Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
• Communities in Networks
• Ideological differences in engagement in public debate on Twitter
• Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach
• What do we see when we look at networks
• Hierarchical clustering for graph visualization
• Kissing Cuisines: Exploring Worldwide Culinary Habits on the Web
• Ordered community structure in networks
• Grounding force-directed network layouts with latent space models
• New paper-by-paper classification for Scopus based on references reclassified by the origin of the papers citing them
• Quantifying Controversy in Social Media
• Community detection by resistance distance: automation and benchmark testing
• Global research collaboration: Networks and partners in South East Asia
• The Twitter Explorer: a Framework for Observing Twitter through Interactive Networks
• A statistical network analysis of the HIV/AIDS epidemics in Cuba
• COAST: A Convex Optimization Approach to Stress-Based Embedding
• Putting Recommendations on the Map -- Visualizing Clusters and Relations
• Visual Mining of Epidemic Networks
• Revealing patterns in HIV viral load data and classifying patients via a novel machine learning cluster summarization method
• Self-organized manifold learning and heuristic charting via adaptive metrics
• Spring-Electrical Models For Link Prediction
• Visualizing and Interacting with Concept Hierarchies