|
|
|
|
References
|
|
| |
| 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   |
| 4. |
Clauset A., Newman M. E., Moore C., “Finding community structure in very large networks”, Phys. Rev. E, 70:6 (2004), 066111  |
| 5. |
Fortunato S., “Community detection in graphs”, Phys. Rep., 486 (2010), 75–174  |
| 6. |
Girvan M., Newman M. E., “Community structure in social and biological networks”, Proc. Natl. Acad. Sci. USA, 99 (2002), 7821–7826  |
| 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 |
| 8. |
Lambiotte R., Rosvall M., “Ranking and clustering of nodes in networks with smart teleportation”, Phys. Rev. E, 85:5 (2012), 056107 |
| 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 |
| 10. |
Lancichinetti A., Fortunato S., “Community detection algorithms: a comparative analysis”, Phys. Rev. E, 80:5 (2009), 056117 |
| 11. |
Lancichinetti A., Fortunato S., Radicchi F., “Benchmark graphs for testing community detection algorithms”, Phys. Rev. E, 78:4 (2008), 046110 |
| 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 |
| 13. |
Massen C. P., Doye J. P. K., “Identifying communities within energy landscapes”, Phys. Rev. E, 71 (2005), 046101 |
| 14. |
Newman M. E., “Fast algorithm for detecting community structure in networks”, Phys. Rev. E, 69 (2004), 066133 |
| 15. |
Newman M. E., “Modularity and community structure in networks”, Proc. Natl. Acad. Sci. USA, 103 (2006), 8577–8582 |
| 16. |
Newman M. E., Networks: An Introduction, Oxford Univ. Press, Oxford, 2010 |
| 17. |
Newman M. E., Girvan M., “Finding and evaluating community structure in networks”, Phys. Rev. E, 69 (2004), 026113 |
| 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 |
| 19. |
Rosvall M., Axelsson D., Bergstrom C. T., “The map equation”, Eur. Phys. J. Special Topics, 178:1 (2009), 13–23 |
| 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 |
| 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 |
