Fetching the paper…
Reading the bibliography…
The discovery of community structure is a common challenge in the analysis of network data.
W. M. Rand, Objective criteria for the evaluation of clustering methods. Journal of American Statistical Association
1971
Earlier work this paper cites.
W. W. Zachary, An information flow model for conflict and fission in small groups. Journal of Anthropological Research
1977
Earlier work this paper cites.
F. Brglez, D. Bryan, and K. Kozminski, Iscas’89 benchmarks. Proc. IEEE Int. Symp. Circuits Syst
1989
Earlier work this paper cites.
T. Łuczak, Sparse random graphs with a given degree sequence. In A. M. Frieze and T. Łuczak (eds.), Proceedings of the Symposium on Random Graphs, Poznań 1989
1992
Earlier work this paper cites.
M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence. Random Structures and Algorithms
1995
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, Collective dynamics of ‘small-world’ networks. Nature
1998
Earlier work this paper cites.
S. V. Dongen, Performance criteria for graph clustering and Markov cluster experiments. National Research Institute for Mathematics and Computer Science in the Netherlands (2000)
2000
Earlier work this paper cites.
H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A. L. Barabasi, The large-scale organization of metabolic networks. Nature
2000
Earlier work this paper cites.
R. Cancho, C. Janssen, and R. Sole, Topology of technology graphs: Small world patterns in electronic circuits. Phys. Rev. E
2001
Earlier work this paper cites.
M. Girvan and M. E. J. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA
2002
Earlier work this paper cites.
M. Meila, Comparing clusterings. Technical report, University of Washington, statistics 418 (2002)
2002
Earlier work this paper cites.
M. A. J. van Duijn, E. P. H. Zeggelink, M. Huisman, F. N. Stokman, and F. W. Wasseur, Evolution of sociology freshmen into a friendship network. J. Math. Sociol
2003
Earlier work this paper cites.
M. E. J. Newman, Detecting community structure in networks. Eur. Phys. J. B
2004
Earlier work this paper cites.
M. E. J. Newman and M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E
2004
Earlier work this paper cites.
F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA
2004
Cited alongside, same era.
M. E. J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E
2004
Cited alongside, same era.
A. Clauset, M. E. J. Newman, and C. Moore, Finding community structure in very large networks. Phys. Rev. E
2004
Cited alongside, same era.
R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E
2004
Cited alongside, same era.
R. Milo, S. Iztkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. AyzenShtat, M. Sheffer, and U. Alon, Superfamilies of evolved and designed networks. Science
2004
Cited alongside, same era.
M. Newman, Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA
2006
Later among the works it cites.
M. Hastings, Community detection as an inference problem. Phys. Rev. E
2006
Later among the works it cites.
A. Clauset, M. E. J. Newman, and C. Moore, Structural inference of hierarchies in networks. In Proceedings of the 23rd International Conference on Machine Learning
2006
Later among the works it cites.
J. Reichardt and S. Bornholdt, Statistical mechanics of community detection. Phys. Rev. E
2006
Later among the works it cites.
M. E. J. Newman, Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA
2006
Later among the works it cites.
J. Reichardt and S. Bornholdt, When are networks truly modular? Preprint cond-mat/0606220 (2006)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, Comparing community structure identification. J. Stat. Mech
2005
Cited alongside, same era.
I. Derenyi, G. Palla, and T. Vicsek, Clique percolation in random networks. Phys. Rev. Lett
2005
Cited alongside, same era.
J. Duch and A. Arenas, Community detection in complex networks using extremal optimization. Phys. Rev. E
2005
Cited alongside, same era.
R. Guimerà and L. A. N. Amaral, Functional cartography of complex metabolic networks. Nature
2005
Cited alongside, same era.
A. Medus, G. Acuña, and C. O. Dorso, Detection of community structures in networks via global optimization. Physica A
2005
Cited alongside, same era.
C. P. Massen and J. P. K. Doye, Identifying “communities” within energy landscapes. Phys. Rev. E
2005
Cited alongside, same era.
D. J. Earl and M. W. Deem, Parallel tempering: Theory, applications, and new perspectives. Phys. Chem. Chem. Phys
2005
Cited alongside, same era.
2006
Later among the works it cites.
J. Reichardt and S. Bornholdt, Statistical mechanics of community detection. Phys. Rev. E
2006
Later among the works it cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory, Second Edition
2006
Later among the works it cites.
S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino, and A. Rapisarda, Detection of complex networks modularity by dynamical clustering. Phys. Rev. E
2007
Closest in time.
A. Arenas, J. Duch, A. Fernandez, and S. Gomez, Size reduction of complex networks preserving modularity. Preprint arXiv:physics/0702015 (2007)
2007
Closest in time.
G. Palla, I. J. Farkas, P. Pollner, I. Derenyi, and T. Vicsek, Directed network modules. Preprint arXiv:physics/0703248 (2007)
2007
Closest in time.
M. Rosvall and C. T. Bergstrom, An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. USA
2007
Closest in time.
C. P. Massen and J. P. Doye, Thermodynamics of community structure. Preprint arXiv:cond-mat/0610077 (2007)
2007
Closest in time.
M. Meila, Comparing clusterings–an information based distance. Journal of Multivariate Analysis
2007
Closest in time.