Geodesic
An algorithm for detecting communities in social networks
Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 21-32.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper, we propose an algorithm to find subgraphs with given properties in large social networks. A computational experiment that confirms the effectiveness of the proposed algorithm is presented. 
@article{FPM_2014_19_1_a2,
     author = {M. I. Kolomeychenko and A. A. Chepovskiy and A. M. Chepovskiy},
     title = {An algorithm for detecting communities in social networks},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {21--32},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/}
}
TY  - JOUR
AU  - M. I. Kolomeychenko
AU  - A. A. Chepovskiy
AU  - A. M. Chepovskiy
TI  - An algorithm for detecting communities in social networks
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2014
SP  - 21
EP  - 32
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/
LA  - ru
ID  - FPM_2014_19_1_a2
ER  - 
%0 Journal Article
%A M. I. Kolomeychenko
%A A. A. Chepovskiy
%A A. M. Chepovskiy
%T An algorithm for detecting communities in social networks
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2014
%P 21-32
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/
%G ru
%F FPM_2014_19_1_a2
M. I. Kolomeychenko; A. A. Chepovskiy; A. M. Chepovskiy. An algorithm for detecting communities in social networks. Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 21-32. http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/

[1] Batura T. V., “Metody analiza kompyuternykh sotsialnykh setei”, Vestn. NGU, Ser. Informatsionnye tekhnologii, 10:4 (2012), 13–28

[2] Churakov A. N., “Analiz sotsialnykh setei”, SotsIs., 2001, no. 1, 109–121

[3] Blondel V. D., Guillaume J.-L., Lambiotte R., Lefebvre E., “The Louvain method for community detection in large networks”, J. Statist. Mech. Theory Experiment, 2008:10 (2008), P10008 | DOI

[4] Clauset A., Newman M. E., Moore C., “Finding community structure in very large networks”, Phys. Rev. E, 70:6 (2004), 066111 | DOI

[5] Fortunato S., “Community detection in graphs”, Phys. Rep., 486 (2010), 75–174 | DOI | MR

[6] Girvan M., Newman M. E., “Community structure in social and biological networks”, Proc. Natl. Acad. Sci. USA, 99 (2002), 7821–7826 | DOI | MR | Zbl

[7] Guimera R., Sales-Pardo M., Amaral L. A. N., “Modularity from fluctuations in random graphs and complex networks”, Phys. Rev. E, 70:2 (2004), 025101 | DOI

[8] Lambiotte R., Rosvall M., “Ranking and clustering of nodes in networks with smart teleportation”, Phys. Rev. E, 85:5 (2012), 056107 | DOI

[9] Lancichinetti A., Fortunato S., “Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities”, Phys. Rev. E, 80:1 (2009), 016118 | DOI

[10] Lancichinetti A., Fortunato S., “Community detection algorithms: a comparative analysis”, Phys. Rev. E, 80:5 (2009), 056117 | DOI

[11] Lancichinetti A., Fortunato S., Radicchi F., “Benchmark graphs for testing community detection algorithms”, Phys. Rev. E, 78:4 (2008), 046110 | DOI

[12] Lovasz L., “Random walks on graphs: a survey”, Combinatorics, Paul Erdős is Eighty, Bolyai Soc. Math. Stud., 2, eds. D. Miklós, V. T. Sós, T. Szőnyi, Budapest, 1996, 353–397 | MR | Zbl

[13] Massen C. P., Doye J. P. K., “Identifying communities within energy landscapes”, Phys. Rev. E, 71 (2005), 046101 | DOI

[14] Newman M. E., “Fast algorithm for detecting community structure in networks”, Phys. Rev. E, 69 (2004), 066133 | DOI

[15] Newman M. E., “Modularity and community structure in networks”, Proc. Natl. Acad. Sci. USA, 103 (2006), 8577–8582 | DOI

[16] Newman M. E., Networks: An Introduction, Oxford Univ. Press, Oxford, 2010 | MR | Zbl

[17] Newman M. E., Girvan M., “Finding and evaluating community structure in networks”, Phys. Rev. E, 69 (2004), 026113 | DOI

[18] Radicchi F., Castellano C., Cecconi F., Loreto V., Parisi D., “Defining and identifying communities in networks”, Proc. Natl. Acad. Sci. USA, 101 (2004), 2658–2663 | DOI

[19] Rosvall M., Axelsson D., Bergstrom C. T., “The map equation”, Eur. Phys. J. Special Topics, 178:1 (2009), 13–23 | DOI

[20] Rosvall M., Bergstrom C. T., “An information-theoretic framework for resolving community structure in complex networks”, Proc. Natl. Acad. Sci. USA, 104:18 (2007), 7327–7331 | DOI

[21] Rosvall M., Bergstrom C. T., “Maps of information flow reveal community structure in complex networks”, Proc. Natl. Acad. Sci. USA, 105:4 (2008), 1118–1123 | DOI