EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs

• Published in: Advances in Knowledge Discovery and Data Mining pp. 435 - 448
• Main Authors: Prakash, B. Aditya, Sridharan, Ashwin, Seshadri, Mukund, Machiraju, Sridhar, Faloutsos, Christos
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010
• Series: Lecture Notes in Computer Science
• Subjects: Large Graph; Patent Citation; Scalable Community; Singular Vector; Spectral Cluster
• ISBN: 3642136710; 9783642136719
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-13672-6_42

We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and millions of calls, and find that the singular vectors of these graphs exhibit a striking EigenSpokes pattern wherein, when plotted against each other, they have clear, separate lines that often neatly align along specific axes (hence the term “spokes”). Furthermore, analysis of several other real-world datasets e.g. Patent Citations, Internet, etc. reveals similar phenomena indicating this to be a more fundamental attribute of large sparse graphs that is related to their community structure. This is the first contribution of this paper. Additional ones include (a) study of the conditions that lead to such EigenSpokes, and (b) a fast algorithm for spotting and extracting tightly-knit communities, called SpokEn, that exploits our findings about the EigenSpokes pattern.