The DOI matches its Crossref record; 128 of the 128 references it cites were found in a registry or an index.
Statistical properties of community structure in large social and information networks
Abstract
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its members than to the remainder of the network. In this paper, we characterize as a function of size the statistical and structural properties of such sets of nodes. We define the network community profile plot, which characterizes the "best" possible community - according to the conductance measure - over a wide range of size scales, and we study over 70 large sparse real-world networks taken from a wide range of application domains. Our results suggest a significantly more refined picture of community structure in large real-world networks than has been appreciated previously.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
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
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · 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
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
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
Complex 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
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
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
Power-law distributions in empirical data
Clauset, A. J., Shalizi, C. R., & Newman, M. E. J. (2018) · Figshare · doi:10.1184/r1/6586835.v1 · Cited by 6,504
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
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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 · cited 1×
“[131] view communities as a chain of adjacent cliques and focus”
BackgroundLethality 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
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
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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Characterization 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
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Self-citationDefining 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 · cited 1×
“[133] to define and apply the notions of a strong community and a weak community.”
BackgroundA critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Self-citationLusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-003-0651-y · Cited by 2,277
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007) · ACM Transactions on the Web · doi:10.1145/1232722.1232727 · Cited by 2,032
Self-citationDetecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Multilevelk-way Partitioning Scheme for Irregular Graphs
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1404 · Cited by 1,675
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
A multilevel algorithm for partitioning graphs
Hendrickson, B., & Leland, R. (1995) · Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '95 · doi:10.1145/224170.224228 · Cited by 1,069
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
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
Dhillon, I. S., Guan, Y., & Kulis, B. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1115 · Cited by 1,003
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Self-citationA Lower Bound for the Smallest Eigenvalue of the Laplacian
Cheeger, J. (2015) · Problems in Analysis: A Symposium in Honor of Salomon Bochner (PMS-31) · doi:10.1515/9781400869312-013 · Cited by 961
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
A random graph model for massive graphs
Aiello, W., Chung, F., & Lu, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335326 · Cited by 917
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
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
On clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T., & Rao, S. (1999) · Journal of the ACM · doi:10.1145/331524.331526 · Cited by 820
Carlson, J. M., & Doyle, J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582499 · Cited by 814
An information-theoretic framework for resolving community structure in complex networks
Rosvall, M., & Bergstrom, C. T. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0611034104 · Cited by 808
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
Grooming, Gossip, and the Evolution of Language
Dunbar, R., & Fisher, M. (1998) · Cited by 796
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
Spielman, D. A., & Teng, S.-H. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007372 · Cited by 769
Inferring Web communities from link topology
Gibson, D., Kleinberg, J., & Raghavan, P. (1998) · Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98 · doi:10.1145/276627.276652 · Cited by 768
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 766
Applying Common Identity and Bond Theory to Design of Online Communities
Ren, Y., Kraut, R., & Kiesler, S. (2007) · Organization Studies · doi:10.1177/0170840607076007 · Cited by 718
Chung, F., & Lu, L. (2006) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/107 · Cited by 700
Stochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Klimt, B., & Yang, Y. (2004) · Conference on Email and Anti-Spam · Cited by 575
Patterns of Cascading Behavior in Large Blog Graphs
Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N., & Hurst, M. (2007) · Proceedings of the 2007 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.60 · Cited by 570
Self-citationMixture models and exploratory analysis in networks
Newman, M. E. J., & Leicht, E. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610537104 · Cited by 554
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 519
Beyond the flow decomposition barrier
Goldberg, A. V., & Rao, S. B. (1998) · Journal of the ACM · doi:10.1145/290179.290181 · Cited by 466
Mathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
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
Influence through social communication.
Back, K. W. (1951) · The Journal of Abnormal and Social Psychology · doi:10.1037/h0058629 · Cited by 433
A Fast Parametric Maximum Flow Algorithm and Applications
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218003 · Cited by 427
A Random Graph Model for Power Law Graphs
Aiello, W., Chung, F., & Lu, L. (2001) · Experimental Mathematics · doi:10.1080/10586458.2001.10504428 · Cited by 405
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Leskovec, J., Chakrabarti, D., Kleinberg, J., & Faloutsos, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564126_17 · Cited by 356
Self-citationRobustness 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
Graph Clustering and Minimum Cut Trees
Flake, G. W., Tarjan, R. E., & Tsioutsiouliklis, K. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129093 · Cited by 333
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
Fabrikant, A., Koutsoupias, E., & Papadimitriou, C. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_11 · Cited by 310
The Average Distance in a Random Graph with Given Expected Degrees
Chung, F., & Lu, L. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129081 · Cited by 307
Tracking evolving communities in large linked networks
Hopcroft, J., Khan, O., Kulis, B., & Selman, B. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307750100 · Cited by 299
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Local method for detecting communities
Bagrow, J. P., & Bollt, E. M. (2005) · Physical Review E · doi:10.1103/physreve.72.046108 · Cited by 283
On the uniform generation of random graphs with prescribed degree sequences
Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J., & Alon, U. (2003) · arXiv · doi:10.48550/arxiv.cond-mat/0312028 · Cited by 281
Gehrke, J., Ginsparg, P., & Kleinberg, J. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/980972.980992 · Cited by 281
The Diameter of Sparse Random Graphs
Chung, F., & Lu, L. (2001) · Advances in Applied Mathematics · doi:10.1006/aama.2001.0720 · Cited by 269
The heat kernel as the pagerank of a graph
Chung, F. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708838104 · Cited by 254
Spectral techniques applied to sparse random graphs
Feige, U., & Ofek, E. (2005) · Random Structures & Algorithms · doi:10.1002/rsa.20089 · Cited by 221
Community detection as an inference problem
Hastings, M. B. (2006) · Physical Review E · doi:10.1103/physreve.74.035102 · Cited by 213
The Spectra of Random Graphs with Given Expected Degrees
Chung, F., Lu, L., & Vu, V. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129089 · Cited by 207
Structural Inference of Hierarchies in Networks
Clauset, A. J., Moore, C., & Newman, M. E. J. (2008) · Springer eBooks · doi:10.1007/978-3-540-73133-7_1 · Cited by 176
RANDOM FOREST SIMILARITY FOR PROTEIN-PROTEIN INTERACTION PREDICTION FROM MULTIPLE SOURCES
QI, Y., KLEIN-SEETHARAMAN, J., & BAR-JOSEPH, Z. (2004) · Biocomputing 2005 · doi:10.1142/9789812702456_0050 · Cited by 175
Mihail, M., & Papadimitriou, C. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45726-7_20 · Cited by 168
A combinatorial, primal-dual approach to semidefinite programs
Arora, S., & Kale, S. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250823 · Cited by 163
Eigenvalues of Random Power law Graphs
Chung, F., Lu, L., & Vu, V. (2003) · Annals of Combinatorics · doi:10.1007/s000260300002 · Cited by 161
On the Quality of Spectral Separators
Guattery, S., & Miller, G. L. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896312262 · Cited by 152
Natural communities in large linked networks
Hopcroft, J. E., Khan, O., Kulis, B., & Selman, B. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956816 · Cited by 143
On certain connectivity properties of the internet topology
Mihail, M., Papadimitriou, C. H., & Saberi, A. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.06.009 · Cited by 142
Identifying Web browsing trends and patterns
Montgomery, A. L., & Faloutsos, C. (2001) · Computer · doi:10.1109/2.933515 · Cited by 135
A simple conceptual model for the Internet topology
Tauro, S. L., Palmer, C., Siganos, G., & Faloutsos, M. (2002) · Globecom · doi:10.1109/glocom.2001.965863 · Cited by 127
Conductance and congestion in power law graphs
Gkantsidis, C., Mihail, M., & Saberi, A. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781046 · Cited by 122
Power Laws, Highly Optimized Tolerance, and Generalized Source Coding
Doyle, J. C., & Carlson, J. M. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.5656 · Cited by 118
Spectral scaling and good expansion properties in complex networks
Estrada, E. (2006) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10441-3 · Cited by 113
The Volume of the Giant Component of a Random Graph with Given Expected Degrees
Chung, F., & Lü, L. (2006) · SIAM Journal on Discrete Mathematics · doi:10.1137/050630106 · Cited by 99
Jellyfish: A conceptual model for the as Internet topology
Siganos, G., Tauro, S. L., & Faloutsos, M. (2006) · Journal of Communications and Networks · doi:10.1109/jcn.2006.6182774 · Cited by 92
Characterization and modeling of protein–protein interaction networks
Colizza, V., Flammini, A., Maritan, A., & Vespignani, A. (2005) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.12.030 · Cited by 91
Partitioning and modularity of graphs with arbitrary degree distribution
Reichardt, J., & Bornholdt, S. (2007) · Physical Review E · doi:10.1103/physreve.76.015102 · Cited by 85
Graph partitioning using single commodity flows
Khandekar, R., Rao, S. B., & Vazirani, U. V. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132574 · Cited by 74
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
Flaxman, A. D., FRIEZE, A. M., & Fenner, T. I. (2003) · Internet Mathematics · doi:10.1007/978-3-540-45198-3_23 · Cited by 72
Gaertler, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31955-9_8 · Cited by 48
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
Arora, S., Hazan, E., & Kale, S. (2010) · SIAM Journal on Computing · doi:10.1137/080731049 · Cited by 45
A Geometric Preferential Attachment Model of Networks
Flaxman, A. D., FRIEZE, A. M., & Vera, J. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30216-2_4 · Cited by 42
Abello, J. M. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.03.012 · Cited by 19
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Self-citationEmpirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Self-citationA measurement-driven analysis of information propagation in the flickr social network
Cha, M., Mislove, A., & Gummadi, K. P. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526806 · Cited by 768
Kronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
Self-citationInferring networks of diffusion and influence
Gomez Rodriguez, M., Leskovec, J., & Krause, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835933 · Cited by 679
Self-citation
Metadata
- Authors
- Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W.
- Venue
- Proceedings of the 17th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2008-04-21
- Pages
- 695-704
- OpenAlex
- W2131717044
- Cited by
- 860
- References
- 128
- FWCI
- 77.90
- 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.