The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Computing Communities in Large Networks Using Random Walks
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
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
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Bollobás, B. (1985) · Cited by 6,196
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
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
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
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
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
Functional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Aldenderfer, M. S. (1984) · Cited by 2,502
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Graph Clustering by Flow Simulation
van Dongen, S. M. (2000) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 1,595
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Community detection in complex networks using extremal optimization
Duch, J., & Arenas, A. (2005) · Physical Review E · doi:10.1103/physreve.72.027104 · Cited by 1,549
Random Walks on Graphs: A Survey
Lovász, L. (2001) · Cited by 1,411
Self-organization and identification of Web communities
Flake, G. W., Lawrence, S., Giles, C. L., & Coetzee, F. M. (2002) · Computer · doi:10.1109/2.989932 · Cited by 1,018
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
(2005) · Lecture Notes in Computer Science · doi:10.1007/b106453 · Cited by 636
Detecting Fuzzy Community Structures in Complex Networks with a Potts Model
Reichardt, J., & Bornholdt, S. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.218701 · Cited by 593
Clustering Large Graphs via the Singular Value Decomposition
Petros Drineas, B., FRIEZE, A. M., Kannan, R., Vempala, S., & Vinay, V. (2004) · Machine Learning · doi:10.1023/b:mach.0000033113.59016.96 · Cited by 487
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
Detecting network communities: a new systematic and efficient algorithm
Donetti, L., & Muñoz, M. A. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/10/p10012 · Cited by 374
On clusterings-good, bad and spectral
Kannan, R., Vempala, S., & Veta, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892125 · Cited by 372
Kleinberg, J., & Lawrence, S. (2001) · Science · doi:10.1126/science.1067014 · Cited by 320
Experiments on Graph Clustering Algorithms
Brandes, U., Gaertler, M., & Wagner, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39658-1_52 · Cited by 317
Evolution of Networks: From Biological Nets to the Internet and WWWPreprint
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · RePEc: Research Papers in Economics · Cited by 315
Method to find community structures based on information centrality
Fortunato, S., Latora, V., & Marchiori, M. (2004) · Physical Review E · doi:10.1103/physreve.70.056104 · Cited by 294
Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck operators
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0506090 · Cited by 294
Local method for detecting communities
Bagrow, J. P., & Bollt, E. M. (2005) · Physical Review E · doi:10.1103/physreve.72.046108 · Cited by 283
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · Oxford University Press eBooks · Cited by 190
Approximation schemes for clustering problems
de la Véga, W. F., Karpiński, M., Mathieu, C., & Rabani, Y. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780550 · Cited by 163
Zhou, H., & Lipowsky, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24688-6_137 · Cited by 141
On Clustering Using Random Walks
Harel, D., & Koren, Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45294-x_3 · Cited by 105
Clustering using a random walk based distance measure
Yen, L., VanVyve, D. J., Wouters, F., et al. (2005) · Cited by 94
Diffusion on complex networks: a way to probe their large-scale topological structures
Simonsen, I., Eriksen, K. A., Maslov, S., & Sneppen, K. (2004) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.01.021 · Cited by 63
Improved spectral algorithm for the detection of network communitiesPreprint
Donetti, L., & Muñoz, M. A. (2005) · Cited by 49
Coarse Grains: The Emergence of Space and Order
Schulman, L. S., & Gaveau, B. (2001) · Foundations of Physics · doi:10.1023/a:1017577211902 · Cited by 45
Hub-Based Community FindingPreprint
Costa, L. D. F. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0405022 · Cited by 30
Fouss, F., Pirotte, A., & Saerens, M. (2004) · Cited by 23
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Finding 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
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
A pathology atlas of the human cancer transcriptome
Uhlen, M., Zhang, C., Lee, S., Sjöstedt, E., Fagerberg, L., Bidkhori, G., Benfeitas, R., Arif, M., Liu, Z., Edfors, F., et al. (2017) · Science · doi:10.1126/science.aan2507 · Cited by 3,371
Molecular ecological network analyses
Deng, Y., Jiang, Y.-H., Yang, Y., He, Z., Luo, F., & Zhou, J. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-113 · Cited by 3,196
Metadata
- Authors
- Pons, P., & Latapy, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 284-293
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2098509290
- Cited by
- 2,048
- References
- 54
- FWCI
- 14.49
- Type
- conference paper
- Language
- en
- Open access
- closed
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.
