The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Method to find community structures based on information centrality
Open accessAbstract
Community structures are an important feature of many social, biological, and technological networks. Here we study a variation on the method for detecting such communities proposed by Girvan and Newman and based on the idea of using centrality measures to define the community boundaries [M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)]. We develop an algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality. We test the algorithm on computer generated and real-world networks whose community structure is already known or has been studied by means of other methods. We show that our algorithm, although it runs to completion in a time O(n4) , is very effective especially when the communities are very mixed and hardly detectable by the other methods.
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
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
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 · cited 9×
“Recently,Girvan and Newman have considered two forms of edge betweenness to measure the edge importance: the shortest path betweenness and the random-walk be-tweenness [17, 18, 19].”
BackgroundMethodInfluentialFinding 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
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Self-citationA faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Scott, J. (1988) · Sociology · doi:10.1177/0038038588022001007 · Cited by 1,058
The Seasonal Dynamics of The Chesapeake Bay Ecosystem
Baird, D., & Ulanowicz, R. E. (1989) · Ecological Monographs · doi:10.2307/1943071 · Cited by 824
Economic small-world behavior in weighted networks
Latora, V., & Marchiori, M. (2003) · The European Physical Journal B - Condensed Matter and Complex Systems · doi:10.1140/epjb/e2003-00095-5 · Cited by 772
Self-citationThe centrality of groups and classes
Everett, M. G., & Borgatti, S. P. (1999) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1999.9990219 · Cited by 665
A graph‐theoretic definition of a sociometric clique†
Alba, R. D. (1973) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1973.9989826 · Cited by 497
Finding communities in linear time: a physics approach
Wu, F., & Huberman, B. A. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00125-x · Cited by 451
Vulnerability and protection of infrastructure networks
Latora, V., & Marchiori, M. (2005) · Physical Review E · doi:10.1103/physreve.71.015103 · Cited by 387
Self-citationSubnetwork hierarchies of biochemical pathways
Holme, P., Huss, M., & Jeong, H. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg033 · Cited by 367
Distance, dissimilarity index, and network community structure
Zhou, H. (2003) · Physical Review E · doi:10.1103/physreve.67.061901 · Cited by 272
Organizing and understanding a winter’s seagrass foodweb network through effective trophic levels
Christian, R. R., & Luczkovich, J. J. (1999) · Ecological Modelling · doi:10.1016/s0304-3800(99)00022-8 · Cited by 260
High-frequency cross-correlation in a set of stocks
Bonanno, G., Lillo, F., & Mantegna, R. N. (2001) · Quantitative Finance · doi:10.1080/713665554 · Cited by 260
Network landscape from a Brownian particle’s perspective
Zhou, H. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.67.041908 · Cited by 166
LS sets, lambda sets and other cohesive subsets
Borgatti, S. P., Everett, M. G., & Shirey, P. R. (1990) · Social Networks · doi:10.1016/0378-8733(90)90014-z · Cited by 135
Vespignani, A. (2003) · Nature Genetics · doi:10.1038/ng1003-118 · Cited by 65
Internal cohesion of ls sets in graphs
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90020-5 · Cited by 46
Finding Communities of Related GenesPreprint
Wilkinson, D. M., & Huberman, B. A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0210147 · Cited by 9
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Vragoviĉ and Louis defined the loop coefficient of i as the average of 1/djk/i over all pairs of neighbors of i, somewhat reminding of the concept of information centrality used in the method by Fortunato et al. (Fortunato et al., 2004).”
BackgroundMethodInfluentialSelf-citationComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationFinding 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
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
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
Metadata
- Authors
- Fortunato, S., Latora, V., & Marchiori, M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-11-15
- Volume
- 70
- Issue
- 5
- Pages
- 056104-056104
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2026601878
- Cited by
- 294
- References
- 31
- FWCI
- 7.05
- 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.