The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Line graphs, link partitions, and overlapping communities
Open accessAbstract
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm that produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.
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
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
Self-citationCommunity 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
Structural Holes and Good Ideas
Burt, R. S. (2004) · American Journal of Sociology · doi:10.1086/421787 · Cited by 5,642
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
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
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
Scientific collaboration networks. I. Network construction and fundamental results
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016131 · Cited by 2,076
Statistical mechanics of community detection
Reichardt, J., & Bornholdt, S. (2006) · Physical Review E · doi:10.1103/physreve.74.016110 · Cited by 2,048
Detecting the overlapping and hierarchical community structure in complex networks
Lancichinetti, A., Fortunato, S., & Kertész, J. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033015 · Cited by 1,941
Bipartite network projection and personal recommendation
Zhou, T., Ren, J., Medo, M., & Zhang, Y.-C. (2007) · Physical Review E · doi:10.1103/physreve.76.046115 · Cited by 1,088
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Modularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
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
Extending the definition of modularity of directed graphs with overlapping communitiesPreprint
Nicosia, V., Mangioni, G., Carchiolo, V., & Malgeri, M. (2009) · Cited by 350
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
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
Communities, knowledge creation, and information diffusion
Lambiotte, R., & Panzarasa, P. (2009) · Journal of Informetrics · doi:10.1016/j.joi.2009.03.007 · Cited by 184
Self-citationMulti-level Algorithms for Modularity Clustering
Noack, A., & Rotta, R. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02011-7_24 · Cited by 161
Uncovering collective listening habits and music genres in bipartite networks
Lambiotte, R., & Ausloos, M. (2005) · Physical Review E · doi:10.1103/physreve.72.066107 · Cited by 136
Self-citation
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Evans and Lambiotte optimized the three corresponding modularity functions to look for partitions in two real networks, Zachary’s karate club (Zachary, 1977) (Section XV.”
BackgroundInfluentialNewman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
Link communities reveal multiscale complexity in networks
Ahn, Y.-Y., Bagrow, J. P., & Lehmann, S. (2010) · Nature · doi:10.1038/nature09182 · Cited by 1,949
Metadata
- Authors
- Evans, T. S., & Lambiotte, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2009-07-09
- Volume
- 80
- Issue
- 1
- Pages
- 016105-016105
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2042276255
- Cited by
- 615
- References
- 23
- FWCI
- 25.01
- 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.