The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Community detection in complex networks using extremal optimization
Open accessAbstract
We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Cited by
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
“In this section I describe briefly another method for dividing networks in two by modularity optimization, which is entirely different from the spectral method.”
BackgroundMethodFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Interestingly, Arenas et al. found that the structural scales revealed by synchronization correspond to groups of eigenvalues of the Laplacian matrix of the graph, separated by gaps (Fig.”
BackgroundMethodInfluentialFrom Louvain to Leiden: guaranteeing well-connected communities
Traag, V. A., Waltman, L., & van Eck, N. J. (2019) · Scientific Reports · doi:10.1038/s41598-019-41695-z · Cited by 5,635
“Optimising modularity is NP-hard 5 , and consequentially many heuristic algorithms have been proposed, such as hierarchical agglomeration 6 , extremal optimisation 7 , simulated annealing 4,8 and spectral 9 algorithms.”
MethodFinding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
Near linear time algorithm to detect community structures in large-scale networks
Raghavan, U. N., Albert, R., & Kumara, S. (2007) · Physical Review E · doi:10.1103/physreve.76.036106 · Cited by 3,502
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Self-citationCharacterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11569596_31 · Cited by 2,048
Sporns, O., & Betzel, R. F. (2016) · Annual Review of Psychology · doi:10.1146/annurev-psych-122414-033634 · Cited by 1,334
Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., & Wagner, D. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190689 · Cited by 1,242
A smart local moving algorithm for large-scale modularity-based community detection
Waltman, L., & van Eck, N. J. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-40829-0 · Cited by 1,088
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
Communities, modules and large-scale structure in networks
Newman, M. E. J. (2012) · Nature Physics · doi:10.1038/nphys2162 · Cited by 787
Modularity and community detection in bipartite networks
Barber, M. J. (2007) · Physical Review E · doi:10.1103/physreve.76.066102 · Cited by 771
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review E · doi:10.1103/physreve.84.066106 · Cited by 747
Detect overlapping and hierarchical community structure in networks
Shen, H., Cheng, X., Cai, K., & Hu, M.-B. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.12.021 · Cited by 723
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
Identifying and ranking influential spreaders in complex networks by neighborhood coreness
Bae, J., & Kim, S. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.10.047 · Cited by 564
Identification of overlapping community structure in complex networks using fuzzy -means clustering
Zhang, S., Wang, R.-S., & Zhang, X.-S. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.07.023 · Cited by 530
The Ubiquity of Small-World Networks
Telesford, Q. K., Joyce, K. E., Hayasaka, S., Burdette, J. H., & Laurienti, P. J. (2011) · Brain Connectivity · doi:10.1089/brain.2011.0038 · Cited by 515
Ranking spreaders by decomposing complex networks
Zeng, A., & Zhang, C.-J. (2013) · Physics Letters A · doi:10.1016/j.physleta.2013.02.039 · Cited by 448
Analysis of the structure of complex networks at different resolution levels
Arenas, A., Fernández, A., & Gómez, S. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/5/053039 · Cited by 446
Self-citationGeneralized Louvain method for community detection in large networks
De Meo, P., Ferrara, E., Fiumara, G., & Provetti, A. (2011) · 2011 11th International Conference on Intelligent Systems Design and Applications · doi:10.1109/isda.2011.6121636 · Cited by 440
Community detection in networks with positive and negative links
Traag, V. A., & Bruggeman, J. (2009) · Physical Review E · doi:10.1103/physreve.80.036115 · Cited by 434
Spectral methods for community detection and graph partitioning
Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.88.042822 · Cited by 424
Toward link predictability of complex networks
Lü, L., Pan, L., Zhou, T., Zhang, Y.-C., & Stanley, H. E. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1424644112 · Cited by 412
Module identification in bipartite and directed networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2007) · Physical Review E · doi:10.1103/physreve.76.036102 · Cited by 406
Overlapping community detection using Bayesian non-negative matrix factorization
Psorakis, I., Roberts, S., Ebden, M., & Sheldon, B. (2011) · Physical Review E · doi:10.1103/physreve.83.066114 · Cited by 399
Quantitative function for community detection
Li, Z., Zhang, S., Wang, R.-S., Zhang, X.-S., & Chen, L. (2008) · Physical Review E · doi:10.1103/physreve.77.036109 · Cited by 382
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
Robustness of community structure in networks
Karrer, B., Levina, E., & Newman, M. E. J. (2008) · Physical Review E · doi:10.1103/physreve.77.046119 · Cited by 350
Community detection in social networks
Bedi, P., & Sharma, C. (2016) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1178 · Cited by 346
Extending the definition of modularity to directed graphs with overlapping communities
Nicosia, V, Mangioni, G., Carchiolo, V, & Malgeri, M. (2009) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2009/03/p03024 · Cited by 346
Equivalence between modularity optimization and maximum likelihood methods for community detection
Newman, M. E. J. (2016) · Physical Review E · doi:10.1103/physreve.94.052315 · Cited by 344
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Modularity-maximizing graph communities via mathematical programming
Agarwal, G., & Kempe, D. (2008) · The European Physical Journal B · doi:10.1140/epjb/e2008-00425-1 · Cited by 338
Size reduction of complex networks preserving modularity
Arenas, A., Duch, J., Fernández, A., & Gómez, S. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/176 · Cited by 330
Self-citationCommunity Detection via Maximization of Modularity and Its Variants
Chen, M., Kuzmin, K., & Szymanski, B. K. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307458 · Cited by 301
Metrics for Community Analysis: A Survey
Chakraborty, T., Dalmia, A., Mukherjee, A., & Ganguly, N. (2018) · ACM Computing Surveys · doi:10.1145/3091106 · Cited by 296
Zeng, G.-Q., Chen, J., Dai, Y.-X., Li, L.-M., Zheng, C.-W., & Chen, M.-R. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.02.051 · Cited by 281
Community Detection in Complex Networks Using Genetic Algorithms
Tasgin, M., Herdağdelen, A., & Bingol, H. O. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.0491 · Cited by 275
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., & Catalyurek, U. (2005) · ACM/IEEE SC 2005 Conference (SC'05) · doi:10.1109/sc.2005.4 · Cited by 261
Analysis of community structure in networks of correlated data
Gómez, S., Jensen, P., & Arenas, A. (2009) · Physical Review E · doi:10.1103/physreve.80.016114 · Cited by 260
Self-citationWang, Y., Di, Z., & Fan, Y. (2011) · PLoS ONE · doi:10.1371/annotation/1935b388-2831-4fb1-b8f2-914ab91c1ddc · Cited by 130
Detecting multiple communities using quantum annealing on the D-Wave system
Negre, C. F. A., Ushijima-Mwesigwa, H., & Mniszewski, S. M. (2020) · PLOS ONE · doi:10.1371/journal.pone.0227538 · Cited by 80
“On the other hand, results for the Jazz and Elegans benchmarks are similar in comparizon, but lower than the values reported in the literature [20].”
BackgroundMethodResult
Metadata
- Authors
- Duch, J., & Arenas, A.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-08-24
- Volume
- 72
- Issue
- 2
- Pages
- 027104-027104
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1985625141
- Cited by
- 1,549
- References
- 36
- FWCI
- 28.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.