Computing communities in large networks using random walks

Journal of Graph Algorithms and Applications

Volumn 10, Issue 2, 2006, Pages 191-218

  Pons, Pascal ^a   Latapy, Matthieu ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES;

AGGLOMERATIVE ALGORITHM; COMMUNITY STRUCTURES; COMPUTING COMMUNITY; DENSE SUB-GRAPHS; INPUT GRAPHS; LARGER NETWORKS; MEASURE OF SIMILARITIES; RANDOM WALK; REAL-WORLD; SPARSE GRAPHS;

COMPLEX NETWORKS;

EID: 38849162343     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00124     Document Type: Article

References (56)

1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47, 2002.
2. R. Albert, J. Hawoong, and B. Albert-László. Diameter of the world wide web. Nature, 401:130, 1999.
3. M. S. Aldenderfer and R. K. Blashfield. Cluster Analysis. Number 07-044 in Sage University Paper Series on Quantitative Applications in the Social Sciences. Sage, Beverly Hills, 1984.
4. D. Aldous and J. A. Fill. Reversible Markov Chains and Random Walks on Graphs, chapter 2. Forthcoming book, http://www.stat.berkeley.edu/users/ aldous/RWG/book.html.
5. J. P. Bagrow and E. M. Bollt. Local method for detecting communities. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 72(4):046108, 2005.
6. T. Bennouas, M. Bouklit, and F. de Montgolfier. Un modèle gravitationnel du web. In 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), Banyuls (France), 2003.
7. U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science. Springer, 2005.
8. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), pages 568-579, 2003.
9. A. Clauset. Finding local community structure in networks. Physical Review E, 72:026132, 2005.
10. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111, 2004.
11. L. da Fontoura Costa. Hub-based community finding. arXiv:condmat/ 0405022, 2004.
12. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment, 2005(09) :P09008, 2005.
13. L. Donetti and M. A. Muñoz. Detecting network communities: a new systematic and efficient algorithm. Journal of Statistical Mechanics, 2004(10):10012, 2004.
14. L. Donetti and M. A. Muñoz. Improved spectral algorithm for the detection of network communities. In Modeling cooperative behavior in the social sciences, volume 779, pages 104-107, 2005.
15. S. Dorogovtsev and J. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford, 2003.
16. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9-33, 2004.
17. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 72(2):027104, 2005.
18. th edition, 2001.
19. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. In Proceedings of the thirty-fifth annual ACM Symposium on Theory of computing, STOC, pages 50-58. ACM Press, 2003.
20. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of web communities. Computer, 35(3):66-71, 2002.
21. S. Fortunato, V. Latora, and M. Marchiori. Method to find community structures based on information centrality. Physical Review E, 70(5):056104, 2004.
22. B. Gaume. Balades aléatoires dans les petits mondes lexicaux. I3 Information Interaction Intelligence, 4(2), 2004.
23. B. Gaveau, A. Lesne, and L. S. Schulman. Spectral signatures of hierarchical relaxation. Physics Letters A, 258(4-6):222-228, July 1999.
24. E. N. Gilbert. Random graphs. The Annals of Mathematical Statistics, 30(4):1141-1144, 1959.
25. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99(12) :7821-7826, 2002.
26. R. Guimerà and L. A. N. Amaral. Functional cartography of complex metabolic networks. Nature, 433:895-900, 2005.
27. D. Harel and Y. Koren. On clustering using random walks. In Proceedings of the 21st Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), LNCS 2245, pages 18-41, 2001.
28. M. Hoerdt and D. Magoni. Completeness of the internet core topology collected by a fast mapping software. In Proceedings of the 11th International Conference on Software, Telecommunications and Computer Networks, pages 257-261, Split, Croatia, October 2003.
29. L. Hubert and P. Arabie. Comparing partitions. Journal of Classification, 2:193-218, 1985.
30. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 31(3):264-323, 1999.
31. M. Jambu and M.-O. Lebeaux. Cluster analysis and data analysis. North Holland Publishing, 1983.
32. H. Jeong, S. Mason, A.-L. Barabási, and Z. N. Oltvai. Centrality and lethality of protein networks. Nature, 411:41-42, 2001.
33. R. Kannan, S. Vempala, and A. Veta. On clusterings: good, bad and spectral. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS'00), page 367, Washington, DC, USA, 2000. IEEE Computer Society.
34. J. Kleinberg and S. Lawrence. The structure of the web. Science, 294(5548):1849-1850, 2001.
35. L. Lovász. Random walks on graphs: a survey. In Combinatorics, Paul Erdos is eighty, Vol. 2 (Keszthely, 1993), volume 2 of Bolyai Soc. Math. Stud., pages 353-397. János Bolyai Math. Soc., Budapest, 1996.
36. B. Nadler, S. Lafon, R. Coifman, and I. Kevrekidis. Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In Proceedings of the 19th Annual Conference on Neural Information Processing Systems (NIPS'05), 2005.
37. M. E. J. Newman. The structure and function of complex networks. SIAM REVIEW, 45:167, 2003.
38. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69(6):066133, 2004.
39. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2):026113, 2004.
40. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814-818, 2005.
41. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 101(9):2658-2663, 2004.
42. W. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical association, 66:846-850, 1971.
43. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási. Hierarchical Organization of Modularity in Metabolic Networks. Science, 297(5586): 1551-1555, 2002.
44. J. Reichardt and S. Bornholdt. Detecting fuzzy community structures in complex networks with a Potts model. Physical Review Letters, 93:218701, 2004.
45. L. S. Schulman and B. Gaveau. Coarse grains: The emergence of space and order. Foundations of Physics, 31(4):713-731, April 2001.
46. I. Simonsen, K. A. Eriksen, S. Maslov, and K. Sneppen. Diffusion on complex networks: a way to probe their large-scale topological structures. Physica A: Statistical Mechanics and its Applications, 336(1-2):163-173, May 2004.
47. S. H. Strogatz. Exploring complex networks. Nature, 410:268-276, March 2001.
48. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, May 2000.
49. J. H. Ward. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58(301):236-244, 1963.
50. S. Wasserman and K. Faust. Social network analysis. Cambridge University Press, Cambridge, 1994.
51. F. Wu and B. A. Huberman. Finding communities in linear time: A physics approach. The European Physical Journal B, 38:331-338, 2004.
52. L. Yen, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens. Clustering using a random walk based distance measure. In Proceedings of the 13th Symposium on Artificial Neural Networks (ESANN 2005), pages 317-324, 2005.
53. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.
54. H. Zhou and R. Lipowsky. Network Brownian motion: A new method to measure vertex-vertex proximity and to identify communities and subcommunities. In International Conference on Computational Science, pages 1062-1069, 2004.
55. http://liafa.jussieu.fr/~pons/.
56. http://www.cs.cornell.edu/projects/kddcup/datasets.html.