Communicability graph and community structures in complex networks

Applied Mathematics and Computation

Volumn 214, Issue 2, 2009, Pages 500-511

  Estrada, Ernesto ^a,b   Hatano, Naomichi ^b  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

All cliques problem; Communicability; Complex networks; Graph spectrum; Network communities

Indexed keywords

ALL-CLIQUES PROBLEM; COMMUNICABILITY; COMPLEX NETWORKS; GRAPH SPECTRUM; NETWORK COMMUNITIES;

AIRPORTS;

EID: 67649185257     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.04.024     Document Type: Article

References (27)

1. V. Batagelj, A. Mrvar, Pajek Datasets, .
2. Bomze M., Budinich M., Pardalos P.M., and Pelillo M. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization. Supplement vol. A (1999), Kluwer, Dordrecht 1-74
3. Bron C., and Kerbosch J. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16 (1973) 575-577
4. Capocci A., Servedio V.D.P., Caldarelli G., and Colaiori F. Detecting communities in large networks. Physica A 352 (2005) 669-676
5. Cvetković D., Rowlinson P., and Simić S. Eigenspaces of Graphs (1997), Cambridge University Press, Cambridge
6. Danon L., Duch J., Diaz-Guilera A., and Arenas A. Comparing community structure identification. J. Stat. Mech.: Theor. Exp. (2005) P09008
7. Duch J., and Arenas A. Community detection in complex networks using extremal optimization. Phys. Rev. E 72 (2005) 027104
8. Estrada E., and Hatano N. Communicability in complex networks. Phys. Rev. E 77 (2008) 036111
9. Filippone M., Camastra F., MAsulli F., and Rovetta S. A survey of kernel and spectral methods for clustering. Pattern Recog. 41 (2008) 176-190
10. Gan G., Ma C., and Wu J. Data Clustering: Theory, Algorithms,and Applications (2007), SIAM, Philadelphia, PA
11. Girvan M., and Newman M.E.J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99 (2002) 7821-7826
12. Guimera R., and Amaral L.A.N. Functional cartography of complex metabolic networks. Nature 433 (2005) 895-900
13. Harary F. Graph Theory (1969), Addison Wesley, Reading, MA
14. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970) 291-307
15. Koch I. Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250 (2001) 1-30
16. Newman M.E.J. The structure and function of complex networks. SIAM Rev. 45 (2003) 167-256
17. Newman M.E.J. Detecting community structure in networks. Eur. Phys. J. B 38 (2004) 321-330
18. Newman M.E.J. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69 (2004) 066133
19. Newman M.E.J. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74 (2006) 036104
20. Palla G., Derenyi I., Farkas I., and Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435 (2005) 814-818
21. Pardalos P.M., and Xue J. The maximum clique problema. J. Global Opt. 4 (1994) 301-328
22. M.A. Porter, J.-P. Onnela, P.J. Mucha, Communities in Networks, arXiv:0902.3788vl.
23. Sørensen T. A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyzes of the vegetation on Danish commons. Biologiske Skrifter 5 (1948) 1-34
24. Tomita E., Tanaka A., and Takahashi H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363 (2006) 28-42
25. Wang X., Chen G., and Lu H. A very fast algorithm for detecting community structures in complex networks. Physica A 384 (2007) 667-674
26. Wasserman S., and Faust K. Social Network Analysis. Methods and Applications (1994), Cambridge University Press
27. Zachary W.W. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33 (1977) 452-473