Local clustering of large graphs by approximate fiedler vectors

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 524-533

  Orponen, Pekka ^a   Schaeffer, Satu Elisa ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

ADJACENCY MATRIX; FIEDLER VECTORS; LOCAL CLUSTERING; NONUNIFORM NETWORKS;

GRAPH THEORY;

EID: 24944550799     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_45     Document Type: Conference Paper

References (26)

1. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms(ESA '03), Lecture Notes in Computer Science 2382, pages 568-579, Berlin Heidelberg, 2003. Springer-Verlag.
2. P. Brémaud. Markov Chains, Gibbs Fields, Monte Carlo Simulation, and Queues. Springer-Verlag, New York, NY, 1999.
3. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, Providence, RI, 1997.
4. F. R. K. Chung and R. B. Ellis. A chip-firing game and Dirichlet eigenvalues. Discrete Mathematics, 257:341-355, 2002.
5. P. G. Doyle and J. L. Snell. Random Walks and Electric Networks. Mathematical Association of America, Washington, DC, 1984.
6. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley, New York, NY, 2001.
7. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298-305, 1973.
8. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25:619-633, 1975.
9. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of Web communities. IEEE Computer, 35(3):66-71, 2002.
10. C. Gkantsidis, M. Mihail, and E. Zegura. Spectral analysis of Internet topologies. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), pages 364-374, New York, NY, 2003. IEEE.
11. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19(3):701-719, 1998.
12. X. He, H. Zha, C. H. Q. Ding, and H. Simon. Web document clustering using hyperlink structures. Computational Statistics & Data Analysis, 41(1):19-45, 2002.
13. J. Hopcroft, O. Khan, B. Kulis, and B. Selman. Natural communities in large linked networks. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 541-546, New York, NY, 2003. ACM.
14. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, 51(3):497-515, 2004.
15. D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC'04), New York, NY, 2004. ACM.
16. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
17. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69:066113, 2004.
18. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.
19. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11:430-452, 1990.
20. S. E. Schaeffer. Stochastic local clustering for massive graphs. In Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'05), Lecture Notes in Computer Science, Berlin Heidelberg, 2005. Springer-Verlag.
21. D. A. Spielman and S.-H. Teng. Spectral partitioning works: planar graphs and finite element meshes. In Proceedings of the 37th IEEE Symposium on Foundations of Computing (FOCS'96), pages 96-105, Los Alamitos, CA, 1996. IEEE Computer Society.
22. S. E. Virtanen. Clustering the Chilean Web. In Proceedings of the First Latin American Web Congress, pages 229-231, Los Alamitos, CA, 2003. IEEE Computer Society.
23. S. E. Virtanen. Properties of nonuniform random graph models. Research Report A77, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2003. URL: http://www.tcs.hut.fi/ Publications/info/bibdb.HUT-TCS-A77.shtml.
24. D. J. Watts. Small Worlds: The Dynamics of Networks between Ordeer and Randomness. Princeton University Press, Princeton, RI, 1999.
25. F. Wu and B. A. Huberman. Finding communities in linear time: a physics approach. The European Physics Journal B, 38:331-338, 2004.
26. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.