Modularity-maximizing graph communities via mathematical programming

European Physical Journal B

Volumn 66, Issue 3, 2008, Pages 409-418

  Agarwal, G ^a,b   Kempe, D ^a  

^a University of Southern California ^*  (United States)

^b Google Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

A POSTERIORI; FRACTIONAL SOLUTIONS; LINEAR PROGRAMING; LINEAR PROGRAMS; MATHEMATICAL PROGRAMS; NATURAL MEASURES; NOVEL ALGORITHMS; PARTITIONING ALGORITHMS; SOLUTION QUALITIES; STANDARD TESTS; VECTOR PROGRAMMINGS;

FUNCTIONS; MATHEMATICAL PROGRAMMING; VECTORS;

APPROXIMATION ALGORITHMS;

EID: 57849146825     PISSN: 14346028     EISSN: 14346036     Source Type: Journal    
DOI: 10.1140/epjb/e2008-00425-1     Document Type: Article

References (49)

1. M. Newman, A. Barabási, D. Watts, The Structure and Dynamics of Networks (Princeton University Press, 2006)
2. J. Scott, Social Network Analysis: A Handbook, 2nd edn. (Sage Publications, 2000)
3. S. Wasserman, K. Faust, Social Network Analysis (Cambridge University Press, 1994)
4. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, The web as a graph: Measurements, models and methods, in International Conference on Combinatorics and Computing, 1999
5. R. Guimerà, L. Amaral, Nature 433, 895 (2005)
6. M. Newman, Phys. Rev. E 74, 036104 (2006)
7. G. Flake, S. Lawrence, C.L. Giles, F. Coetzee, IEEE Computer 35, 66 (2002)
8. M. Girvan, M. Newman, Proc. Natl. Acad. Sci. USA 99, 7821 (2002)
9. M. Newman, Eur. Phys. J. B 38, 321 (2004)
10. J. Duch, A. Arenas, Phys. Rev. E 72, 027104 (2005)
11. G. Flake, R. Tarjan, K. Tsioutsiouliklis, Graph clustering techniques based on minimum cut trees, Technical Report 2002-06 (NEC, Princeton, 2002)
12. A. Hayrapetyan, D. Kempe, M. Pál, Z. Svitkina, Unbalanced graph cuts, in Proc. 13th European Symp. on Algorithms, 2005, pp. 191-202
13. M. Charikar, Greedy approximation algorithms for finding dense components in graphs, in Proc. 3rd Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2000
14. M. Newman, M. Girvan, Phys. Rev. E 69, 026113 (2004)
15. M. Newman, Phys. Rev. E 69, 066133 (2004)
16. A. Clauset, M. Newman, C. Moore, Phys. Rev. E 70, 066111 (2004)
17. A. Clauset, Phys. Rev. E 72, 026132 (2005)
18. M. Newman, Proc. Natl. Acad. Sci. USA 103, 8577 (2006)
19. L. Danon, J. Duch, A. Diaz-Guilera, A. Arenas, J. Stat. Mech. P09008 (2005)
20. S. Fortunato, M. Barthélemy, Proc. Natl. Acad. Sci. USA 104, 36 (2007)
21. J. Kleinberg, An impossibility theorem for clustering, in Proc. Advances in Neural Information Processing Systems (NIPS) (2002)
22. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, D. Wagner, IEEE Trans. Know, Data Eng. 20, 172 (2008)
23. M. Charikar, V. Guruswami, A. Wirth, J. Comput. System Sci. 360 (2005)
24. N. Bansal, A. Blum, S. Chawla, Machine Learning 56, 89 (2004)
25. M. Goemans, D. Williamson, J. ACM 42, 1115 (1995)
26. M. Gaertler, R. Görke, D. Wagner, Significance-driven graph clustering, in Proc. 3rd Intl. Conf. on Algorithmic Aspects in Information and Management, 2007, pp. 11-26
27. V. Chvátal, Linear Programming (Freeman, 1983)
28. H. Karloff, Linear Programming (Birkhäuser, 1991)
29. V. Vazirani, Approximation Algorithms (Springer, 2001)
30. N. Karmarkar, Combinatorica 4, 373 (1984)
31. M. Sales-Pardo, R. Guimera, A. Moreira, L. Amaral, Proc. Natl. Acad. Sci. USA 104, 15224 (2007)
32. M. Fiedler, Czech. Math. J. 25, 619 (1975)
33. B. Borchers, Optim. Meth. Softw. 11, 613 (1999)
34. M. Charikar, A. Wirth, Maximizing quadratic programs: Extending grothendieck's inequality, in Proc. 45th IEEE Symp. on Foundations of Computer Science, 2004, pp. 54-60
35. Y. Nesterov, Optim. Meth. Softw. 9, 141 (1998)
36. B. Kernighan, S. Lin, Bell Systems Tech. J. 49, 291 (1970)
37. A. Lancichinetti, S. Fortunato, F. Radicchi, New benchmark in community detection, 2008, eprint arXiv: 0805.4770
38. W. Zachary, J. Anthropol. Res. 33, (1977)
39. A. Medus, G. Acuña, C. Dorso, Phys. A Stat. Mech. Appl. 358, 593 (2005)
40. D. Gfeller, J.-C. Chappelier, P. De Los Rios, Phys. Rev. E 72, (2005)
41. F. McSherry, Spectral partitioning of random graphs, in Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001, pp. 529-537
42. R. Guimerà, M. Sales-Pardo, L. Amaral, Phys. Rev. E, 70, 025101 (2004)
43. P. Gleiser, L. Danon, Advances in Complex Systems 6, 565 (2003)
44. D. Lusseau, Proc. of the Royal Society of London B 270, 186 (2003)
45. D. Knuth, The Stanford GraphBase: A Platform for Combinatorial Algorithms (ACM Press 1993)
46. M. Newman, Phys. Rev. E 64, (2001)
47. H. Jeong, B. Tomber, R. Albert, Z. Oltvai, A.-L. Barabási, Nature 407, 651 (2000)
48. R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, A. Arenas, Phys. Rev. E 68, 065103 (2003)
49. R. Guimerà, L. Amaral, J. Stat. Mech. P02001 (2005)