Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
Computer Vision and Image Understanding
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A Factorization Approach to Grouping
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fully automatic cross-associations
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
On mining cross-graph quasi-cliques
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
On the structural properties of massive telecom call graphs: findings and implications
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
A tutorial on spectral clustering
Statistics and Computing
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Data spectroscopy: learning mixture models using eigenspaces of convolution operators
Proceedings of the 25th international conference on Machine learning
Mobile call graphs: beyond power-law and lognormal distributions
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable graph clustering using stochastic flows: applications to community discovery
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Spectral analysis of k-balanced signed graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Spectral analysis for billion-scale graphs: discoveries and implementation
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Comparing clustering schemes at two levels of granularity for mobile call mining
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Managing and mining large graphs: patterns and algorithms
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
OPAvion: mining and visualization in large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Line orthogonality in adjacency eigenspace with application to community partition
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Big graph mining: algorithms and discoveries
ACM SIGKDD Explorations Newsletter
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Proceedings of the 22nd international conference on World Wide Web
A spectral approach to detecting subtle anomalies in graphs
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
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.