Fetching the paper…
Reading the bibliography…
Graph vertices are often organized into groups that seem to live fairly independently of the rest of the graph, with which they share but a few edges, whereas the relationships between group members are stronger, as shown by the large number of mutual connections.
Shannon CE, Weaver V (1949) The Mathematical Theory of Communication. University of Illinois Press, Champaign, USA
1949
Earlier work this paper cites.
Erdös P, Rényi A (1959) On Random Graphs. Publicationes Mathematicae Debrecen, Vol 6, pp 290–297
1959
Earlier work this paper cites.
J. B. MacQueen (1967) Some methods for classification and analysis of multivariate observations. Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, pp 281-297
1967
Earlier work this paper cites.
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, Vol 49, pp 291–307
1970
Earlier work this paper cites.
Granovetter M (1973) The Strength of Weak Ties. American Journal of Sociology, Vol 78, pp 1360–1380
1973
Earlier work this paper cites.
Bron C, Kerbosch J (1973) Finding all cliques on an undirected graph. Communications of ACM, Vol 16, pp 575–577
1973
Earlier work this paper cites.
Burt RS (1976) Positions in Networks. Social Forces, Vol 55, No 1, pp 93-122
1976
Earlier work this paper cites.
Freeman LC (1977) A Set of Measures of Centrality Based on Betweenness. Sociometry, Vol 40, No 1, pp 35–41
1977
Earlier work this paper cites.
Zachary WW (1977) An information flow model for conflict and fission in small groups. Journal of Anthropological Research, Vol 33, pp 452–473
1977
Earlier work this paper cites.
Pimm SL (1979) The structure of food webs. Theoretical Population Biolology, Vol 16, pp 144–158
1979
Earlier work this paper cites.
Wu FY (1982) The Potts model. Reviews of Modern Physics, Vol 54, pp 235–268
1982
Earlier work this paper cites.
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science, Vol 220, No 4598, pp 671–680
1983
Earlier work this paper cites.
Kuramoto Y (1984) Chemical Oscillations, Waves and Turbulence. Springer-Verlag, Berlin, Germany
1984
Earlier work this paper cites.
Mezard M, Parisi G, Virasoro M (1987) Spin glass theory and beyond. World Scientific Publishing Company, Singapore
1987
Earlier work this paper cites.
Golub GH, Van Loan CF (1989) Matrix computations. John Hopkins University Press, Baltimore, MD, USA
1989
Earlier work this paper cites.
Wasserman S, Faust K (1994) Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (UK)
1994
Earlier work this paper cites.
Blatt M, Wiseman S, Domany E (1996) Superparamagnetic clustering of data. Physical Review Letters, Vol 76, No 18, pp 3251–3254
1996
Earlier work this paper cites.
Pothen A (1997) Graph partitioning algorithms with applications to scientific computing. In Parallel Numerical Algorithms, Keyes DE, Sameh A and Venkatakrishnan V, Eds., Kluwer Academic Press, pp 323–368
1997
Earlier work this paper cites.
Bollobás B (1998) Modern Graph Theory. Springer Verlag, New York (USA)
1998
Earlier work this paper cites.
Watts D, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature, Vol 393, pp 440–442
1998
Earlier work this paper cites.
Scott JP (2000) Social Network Analysis. Sage Publications Ltd., London (UK)
2000
Earlier work this paper cites.
van Dongen S (2000) Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, Netherlands
2000
Earlier work this paper cites.
Brandes, U (2001) A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, Vol 25, No 2, pp 163–177
2001
Earlier work this paper cites.
Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Physical Review Letters, Vol 87, 198701
2001
Earlier work this paper cites.
Boettcher S, Percus AG (2001) Optimization with extremal dynamics. Physical Review Letters, Vol 86, pp 5211–5214
2001
Earlier work this paper cites.
Barabási Al, Albert R (2002) Statistical mechanics of complex networks. Reviews of Modern Physics, Vol 74, pp 47–97
2002
Earlier work this paper cites.
Flake GW, Lawrence S, Lee Giles C, Coetzee FM (2002) Self-Organization and Identification of Web Communities. IEEE Computer, Vol 35, No 3, pp 66–71
2002
Earlier work this paper cites.
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proceedings of the National Academy of Science of the USA, Vol 99, No 12, pp 7821–7826
2002
Earlier work this paper cites.
Eckmann J.-P, Moses E (2002) Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Proceedings of the National Academy of Science of the USA, Vol 99, No 9, pp 5825–5829
2002
Earlier work this paper cites.
Dorogovtsev SN, Mendes JFF (2003) Evolution of Networks: from biological nets to the Internet and WWW. Oxford University Press, Oxford (UK)
2003
Earlier work this paper cites.
Newman MEJ (2003) The structure and function of complex networks. SIAM Review, Vol 45, pp 167–256
2003
Earlier work this paper cites.
Krause AE, Frank KA, Mason DM, Ulanowicz RE, Taylor WW (2003) Compartments exposed in food-web structure. Nature, Vol 426, p 282–285
2003
Earlier work this paper cites.
Tyler JR, Wilkinson DM, Huberman BA (2003) Email as spectroscopy: automated discovery of community structure within organizations. Proceeding of the First International Conference on Communities and Technologies, Huysman M, Wenger E and Wulf V, Eds., Kluwer Academic Press, Amsterdam
2003
Cited alongside, same era.
Eriksen KA, Simonsen I, Maslov S, Sneppen K (2003) Modularity and extreme edges of the Internet. Physical Review Letters, Vol 90, No 14, 148701
2003
Cited alongside, same era.
Zhou H (2003) Network landscape from a Brownian particle’s perspective. Physical Review E, Vol 67, 041908
2003
Cited alongside, same era.
Zhou H (2003) Distance, dissimilarity index, and network community structure. Physical Review E, Vol 67, 061901
2003
Cited alongside, same era.
Lusseau D (2003) The emergent properties of a dolphin social network. Proceedings of the Royal Society of London B, Vol 270 (Suppl. 2), pp S186–188
Guimerá R, Amaral LAN (2005) Cartography of complex networks: modules and universal roles. Journal of Statistical Mechanics: Theory and Experiment, P02001
2005
Later among the works it cites.
Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex Networks: Structure and Dynamics. Physics Reports, Vol 424, pp 175–308
2006
Later among the works it cites.
Pollner P, Palla G, Vicsek T (2006) Preferential attachment of communities: The same principle, but a higher level. Europhysics Letters, Vol 73, No 3, pp 478–484
2006
Later among the works it cites.
Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection. Physical Review E, Vol 74, 016110
2006
Later among the works it cites.
Massen CP, Doye JPK (2006) Thermodynamics of community structure. Eprint cond-mat/0610077 in www.arxiv.org
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
Pastor-Satorras R, Vespignani A (2004) Evolution and structure of the Internet: A statistical physics approach. Cambridge University Press, Cambridge (UK)
2004
Cited alongside, same era.
Lusseau D, Newman MEJ (2004) Identifying the role that animals play in their social networks. Proceedings of the Royal Society of London B, Vol 271, pp S477–S481
2004
Cited alongside, same era.
Newman MEJ (2004) Detecting community structure in networks. European Physical Journal B, Vol 38, pp 321–330
2004
Cited alongside, same era.
Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proceedings of the National Academy of Science of the USA, Vol 101, No 9, pp 2658–2663
2004
Cited alongside, same era.
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Physical Review E, Vol 69, 026113
2004
Cited alongside, same era.
Guimerà R, Sales-Pardo M, Amaral LAN (2004) Modularity from fluctuations in random graphs and complex networks. Physical Review E, Vol 70, 025101(R)
2004
Cited alongside, same era.
Wilkinson DM, Huberman BA (2004) A method for finding communities of related genes. Proceedings of the National Academy of Science of the USA, Vol 101, Suppl 1, pp 5241–5248
2004
Cited alongside, same era.
Danon L, Díaz-Guilera A, Arenas A (2006) The effect of size heterogeneity on community identification in complex networks. Journal of Statistical Mechanics: Theory and Experiment, Issue 11, P11010
2006
Later among the works it cites.
Pujol JM, Béjar J, Delgado J (2006) Clustering algorithm for determining community structure in large networks. Physical Review E, Vol 74, 016107
2006
Later among the works it cites.
Newman MEJ (2006) Modularity and community structure in networks. Proceedings of the National Academy of Science of the USA, Vol 103, No. 23, pp 8577–8582
2006
Later among the works it cites.
Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Physical Review E, Vol 74, 036104
2006
Later among the works it cites.
Reichardt J, Bornholdt S (2006) When are networks truly modular? Physica D, Vol 224, pp 20–26
2006
Later among the works it cites.
Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection Physical Review E, Vol 74, 016110
2006
Later among the works it cites.
Arenas A, Díaz-Guilera A, Pérez-Vicente CJ (2006) Synchronization reveals topological scales in complex networks. Physical Review Letters, Vol 96, 114102
2006
Later among the works it cites.
Gustafsson M, Hörnquist M, Lombardi A (2006) Comparison and validation of community structures in complex networks. Physica A, Vol 367, pp 559–576
2006
Later among the works it cites.
Danon L, Duch J, Arenas A, Díaz-Guilera A (2007) Community structure identification. Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science, Caldarelli G and Vespignani A, Eds., World Scientific, Singapore, pp 93–114
2007
Closest in time.
2007
Closest in time.
Arenas A, Duch J, Fernándes A, Gómez S (2007) Size reduction of complex networks preserving modularity. New Journal of Physics, Vol 9, No 6, pp 176–180
2007
Closest in time.
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proceedings of the National Academy of Science of the USA, Vol 104, No 1, pp 36–41
2007
Closest in time.
Brandes U, Delling D, Gaertler M, Görke R, Hoefer M, Nikoloski Z, Wagner D (2007) On finding graph clusterings with maximum modularity. Proceedings of the 33rd International Workshop on Graph-Theoretical Concepts in Computer Science (WG’07), Springer Verlag, Berlin-Heidelberg, Germany
2007
Closest in time.
Reichardt J, Bornholdt S (2007) Partitioning and modularity of graphs with arbitrary degree distribution. Physical Review E, Vol 76, 015102(R)
2007
Closest in time.
Kumpula JM, Saramäki J, Kaski K, Kertész J (2007) Limited resolution in complex network community detection with Potts model approach. European Physical Journal B, Vol 56, pp 41–45
2007
Closest in time.
Arenas A, Fernándes A, Gómez S (2007) Multiple resolution of the modular structure of complex networks. Eprint physics/0703218 at www.arxiv.org
2007
Closest in time.
Ruan J, Zhang W (2007) Identifying network communities with high resolution. Eprint arXiv: 0704.3759 in www.arxiv.org, to appear in Physical Review E
2007
Closest in time.
Kumpula JM, Saramäki J, Kaski K, Kertész J (2007) Limited resolution and multiresolution methods in complex network community detection. Noise and Stochastics in Complex Systems and Finance, Kertész J, Bornholdt S and Mantegna RN, Eds. Proceedings of the SPIE, Vol 6601, pp 660116
2007
Closest in time.
Arenas A, Díaz-Guilera A (2007) Synchronization and modularity in complex networks. European Physical Journal ST, Vol 143, pp 19–25
2007
Closest in time.
Boccaletti S, Ivanchenko M, Latora V, Pluchino A, Rapisarda A (2007) Detecting complex network modularity by dynamical clustering. Physica Review E, Vol 76, 045102(R)
2007
Closest in time.
Farkas I, Ábel D, Palla G, Vicsek T (2007) Weighted network modules. New Journal of Physics, Vol 9, pp 180
2007
Closest in time.
Palla G, Farkas IJ, Pollner P, Derényi I, Vicsek T (2007) Directed network modules. New Journal of Physics, Vol 9, pp 186
2007
Closest in time.
Palla G, Barabási A-L, Vicsek T (2007) Quantifying social groups evolution. Nature, Vol 446, pp 664–667
2007
Closest in time.
Newman MEJ, Leicht E (2007) Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Science of the USA, Vol 104, No 23, pp 9564–9569
2007
Closest in time.
2007
Closest in time.
Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Science of the USA, Vol 104, No 18, pp 7327–7331
2007
Closest in time.