The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Graphs over time: densification laws, shrinking diameters and possible explanations
Abstract
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include heavy tails for in- and out-degree distributions, communities, small-world phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time.Here we study a wide range of real graphs, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing super-linearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should increase slowly as a function of the number of nodes (like O(log n) or O(log(log n)).Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Finally, the study of networks in a variety of applications assumes static networks, with some notable exceptions.21”
From A Big Data Guide to Understanding Climate Change: The Case for Theory-Guided Data Science (2014) · cites this paper as [21]
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 5,528
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/316188.316229 · Cited by 4,279
Self-citationDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (1999) · Nature · doi:10.1038/43601 · Cited by 4,240
The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools
Hall, B. H., Jaffe, A. B., & Trajtenberg, M. (2001) · National Bureau of Economic Research · doi:10.3386/w8498 · Cited by 3,450
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,275
Self-citationA Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Identity and Search in Social Networks
Watts, D. J., Dodds, P. S., & Newman, M. E. J. (2002) · Science · doi:10.1126/science.1070120 · Cited by 1,060
Research works printed but not linked: 4
- 10.5555/647908.740141 · DOI
- 10.5555/779232 · DOI
- A. Broder , R. Kumar , F. Maghoul , P. Raghavan , S. Rajagopalan , R. Stata , A. Tomkins , and J. Wiener . Graph structure in the web: experiments and models . In Proceedings of World Wide Web Conference , 2000 .]] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In Proceedings of World Wide Web Conference, 2000.]]
- 10.5555/795666.796570 · DOI
Cited by
Sorted by citations
Items 701–800 of 1,000
Relational Representation Learning for Dynamic (Knowledge) Graphs: A Survey.Preprint
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv (Cornell University) · Cited by 22
Online community detection for large complex networks
Zhang, W., Pan, G., Wu, Z., & Li, S. (2013) · International Joint Conference on Artificial Intelligence · Cited by 20
Come-and-Go Patterns of Group Evolution
Zhang, T., Cui, P., Faloutsos, C., Lu, Y., Ye, H., Zhu, W., & Yang, S. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939795 · Cited by 20
Self-citationTensor fusion of social structural and functional analytics over Neo4j
Δρακόπουλος, Γ. (2016) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa.2016.7785365 · Cited by 20
Community-Based Network Alignment for Large Attributed Network
Chen, Z., Yu, X., Song, B., Gao, J., Hu, X., & Yang, W.-S. (2017) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3132847.3132904 · Cited by 20
Content Delivery in Cache-Enabled Wireless Evolving Social Networks
Qin, Z., Gan, X., Fu, L., Di, X., Tian, J., & Wang, X. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2863687 · Cited by 20
The scaling of social interactions across animal species
Rocha, L. E. C., Ryckebusch, J., Schoors, K. J. L., & Smith, M. X. (2021) · Scientific Reports · doi:10.1038/s41598-021-92025-1 · Cited by 24
General graph generators: experiments, analyses, and improvements
Xiang, S., Wen, D., Cheng, D., Zhang, Y., Qin, L., Qian, Z., & Lin, X. (2021) · The VLDB Journal · doi:10.1007/s00778-021-00701-5 · Cited by 21
Hypergraph Ego-networks and Their Temporal Evolution
Comrie, C., & Kleinberg, J. M. (2021) · Proceedings · doi:10.1109/icdm51629.2021.00019 · Cited by 20
Self-citationSparseCore: stream ISA and processor specialization for sparse computation
Rao, G., Chen, J., Yik, J., & Qian, X. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507705 · Cited by 20
An Empirical Performance Evaluation of GPU-Enabled Graph-Processing Systems
Guo, Y., Vărbănescu, A. L., Iosup, A., & Epema, D. H. J. (2015) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2015.20 · Cited by 20
Group formation in elearning-enabled online social networks
Brauer, S., & Schmidt, T. C. (2012) · International Conference on Interactive Collaborative Learning · doi:10.1109/icl.2012.6402070 · Cited by 20
Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks
Li, S., Li, L., Jia, Y., Liu, X., & Yang, Y. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/938398 · Cited by 20
Evolving debates in online communication: a graph analytical approach
Prabowo, R., Thelwall, M. A., Hellsten, I., & Scharnhorst, A. (2008) · Internet Research · doi:10.1108/10662240810912765 · Cited by 20
A data driven anonymization system for information rich online social network graphs
Nettleton, D., & Salas, J. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.02.004 · Cited by 20
Input graph: the hidden geometry in controlling complex networks
Zhang, X., Lv, T., & Pu, Y. (2016) · Scientific Reports · doi:10.1038/srep38209 · Cited by 20
Robust Exact Distance Queries on Massive Networks
Delling, D., Goldberg, A. V., Pajor, T., & Werneck, R. F. (2014) · Cited by 20
Targeted Misinformation Blocking on Online Social Networks
Pham, C. V., Phu, Q. V., & Hoang, H. X. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-75417-8_10 · Cited by 20
The Relationship between Online Social Network Ties and User Attributes
Mahmoudi, A., Yaakub, M. R., & Bakar, A. A. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3314204 · Cited by 20
Influence Analysis in Evolving Networks: A Survey
Yu, Y., & Pei, J. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2934447 · Cited by 20
Alassad, M., Hussain, M. N., & Agarwal, N. (2019) · Communications in computer and information science · doi:10.1007/978-3-030-29862-3_4 · Cited by 20
Hypersparse Neural Network Analysis of Large-Scale Internet Traffic
Kepner, J., Cho, K., claffy, K., Gadepally, V. N., Michaleas, P. W., & Milechin, L. (2019) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2019.8916263 · Cited by 20
IncNSA: Detecting communities incrementally from time-evolving networks based on node similarity
Su, X., Cheng, J., Yang, H., Leng, M., Zhang, W., & Chen, X. (2020) · International Journal of Modern Physics C · doi:10.1142/s0129183120500941 · Cited by 20
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter
Trolliet, T., Cohen, N., Giroire, F., Hogie, L., & Pérennès, S. (2021) · Studies in computational intelligence · doi:10.1007/978-3-030-65351-4_48 · Cited by 20
Who to follow recommendation in large-scale online development communities
Schall, D. (2013) · Information and Software Technology · doi:10.1016/j.infsof.2013.12.003 · Cited by 20
ValuePick: Towards a Value-Oriented Dual-Goal Recommender System
Akoglu, L., & Faloutsos, C. (2010) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2010.68 · Cited by 20
Self-citationGreyCat: Efficient what-if analytics for data in motion at scale
Hartmann, T., Fouquet, F., Moawad, A., Rouvoy, R., & Traon, Y. L. (2019) · Information Systems · doi:10.1016/j.is.2019.03.004 · Cited by 20
Revisiting Dynamic Graph Clustering via Matrix Factorization
Li, D., Kosugi, S., Zhang, Y., Okumura, M., Xia, F., & Jiang, R. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3696410.3714646 · Cited by 19
Accurately and quickly calculating the weighted spectral distribution
Jiao, B., Nie, Y., Shi, J., Lü, G., Zhou, Y., & Du, J. (2015) · Telecommunication Systems · doi:10.1007/s11235-015-0077-7 · Cited by 19
Dryadic: Flexible and Fast Graph Pattern Matching at Scale
Mawhirter, D., Reinehr, S., Han, W., Fields, N., Claver, M., Holmes, C., McClurg, J., Liu, T., & Wu, B. (2021) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact52795.2021.00028 · Cited by 19
Meta-Learned Metrics over Multi-Evolution Temporal Graphs
Fu, D., Fang, L., Maciejewski, R., Torvik, V. I., & He, J. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539313 · Cited by 19
GNN Model Based On Node Classification Forecasting in Social Network
Awasthi, A. K., Garov, A. K., Sharma, M., & Sinha, M. (2023) · International Conference on Artificial Intelligence and Smart Communication (AISC) · doi:10.1109/aisc56616.2023.10085118 · Cited by 19
Tang, J., Qu, J., Song, S., Zhao, Z., & Du, Q. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.102183 · Cited by 19
CommTracker: A Core-Based Algorithm of Tracking Community Evolution
Wang, Y., Wu, B., & Pei, X. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88192-6_22 · Cited by 19
NetMatchStar: an enhanced Cytoscape network querying app
Rinnone, F., Micale, G., Bonnici, V., Bader, G. D., Shasha, D. E., Ferro, A., Pulvirenti, A., & Giugno, R. (2015) · F1000Research · doi:10.12688/f1000research.6656.1 · Cited by 19
Detecting spam blogs from blog search results
Zhu, L., Sun, A., & Choi, B. K. K. (2010) · Information Processing & Management · doi:10.1016/j.ipm.2010.03.006 · Cited by 19
Towards robust and scalable peer-to-peer social networks
Olteanu, A., & Pierre, G. (2012) · Proceedings of the Fifth Workshop on Social Network Systems · doi:10.1145/2181176.2181186 · Cited by 19
Expansion and search in networks
Maiya, A. S., & Berger-Wolf, T. Y. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871471 · Cited by 19
Temporal web dynamics and its application to information retrieval
Radinsky, K., Díaz, F., Dumais, S., Shokouhi, M., Dong, A., & Chang, Y. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433500 · Cited by 19
Milgram-routing in social networks
Lattanzi, S., Panconesi, A., & Sivakumar, D. (2011) · International World Wide Web Conference (WWW) · doi:10.1145/1963405.1963507 · Cited by 19
Huang, J., Xie, Y., Yu, F., Ke, Q., Abadi, M., Gillum, E., & Mao, Z. M. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484330 · Cited by 19
Social capital in online communities
Smith, M. S. (2008) · Ph.D. Workshop on Information and Knowledge Management · doi:10.1145/1458550.1458554 · Cited by 19
Time Traveling in Graphs using a Graph Database.
Semertzidis, K., & Pitoura, E. (2016) · Cited by 19
DNE: A Method for Extracting Cascaded Diffusion Networks from Social Networks
Eslami, M., Rabiee, H. R., & Salehi, M. (2011) · International Conference on Social Computing · doi:10.1109/passat/socialcom.2011.85 · Cited by 18
Optimizing Graph Processing on GPUs
Zhong, W., Sun, J., Chen, H., Xiao, J., Chen, Z., Chang, C., & Shi, X. (2017) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2016.2611659 · Cited by 19
Deterministic graph exploration for efficient graph sampling
Salamanos, N., Voudigari, E., & Yannakoudakis, E. J. (2017) · Social Network Analysis and Mining · doi:10.1007/s13278-017-0441-6 · Cited by 19
Towards the Dynamic Community Discovery in Decentralized Online Social Networks
Guidi, B., Michienzi, A., & Rossetti, G. (2018) · Journal of Grid Computing · doi:10.1007/s10723-018-9448-0 · Cited by 19
Structural Diversity and Homophily
Dong, Y., Johnson, R. A., Xu, J., & Chawla, N. V. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098116 · Cited by 21
Andersen, D. G., Balakrishnan, H., Feamster, N., Koponen, T., Moon, D., & Shenker, S. J. (2008) · Cited by 19
Evaluating community detection algorithms for progressively evolving graphs
Cazabet, R., Boudebza, S., & Rossetti, G. (2020) · Journal of Complex Networks · doi:10.1093/comnet/cnaa027 · Cited by 23
Complex Networks and Social Networks
Bonato, A., & Tian, Y. (2012) · Mathematics in industry · doi:10.1007/978-3-642-30904-5_12 · Cited by 19
Learning multifractal structure in large networks
Benson, A. R., Riquelme, C., & Schmit, S. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623718 · Cited by 19
Simulated Evolution of Protein-Protein Interaction Networks with Realistic Topology
Peterson, G. J., Pressé, S., Peterson, K. S., & Dill, K. A. (2012) · PLoS ONE · doi:10.1371/journal.pone.0039052 · Cited by 19
Generic Damping Functions for Propagating Importance in Link-Based Ranking
Baeza-Yates, R. A., Boldi, P., & Castillo, C. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129134 · Cited by 18
Homophily in Online Social Networks
Tarbush, B., & Teytelboym, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35311-6_40 · Cited by 19
An agent-based model for the bibliometric h-index
Ionescu, G. V., & Bastien Chopard, B. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-40207-0 · Cited by 19
Extending the Applicability of Graphlets to Directed Networks
Aparício, D., Ribeiro, P., & Silva, F. (2016) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2016.2586046 · Cited by 19
Spectrum-preserving sparsification for visualization of big graphs
Imre, M., Tao, J., Wang, Y., Zhao, Z., Feng, Z., & Wang, C. (2020) · Computers & Graphics · doi:10.1016/j.cag.2020.02.004 · Cited by 19
Semantic Technology for Capturing Communication Inside an Organization
Grobelnik, M., Mladenić, D., & Fortuna, B. (2009) · IEEE Internet Computing · doi:10.1109/mic.2009.88 · Cited by 19
Parallel Generation of Massive Scale-Free GraphsPreprint
Yoo, A., & Henderson, K. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.3684 · Cited by 19
GSCALER: Synthetically Scaling A Given Graph
Zhang, J. W., & Tay, Y. C. (2016) · Movebank · doi:10.5441/002/edbt.2016.08 · Cited by 19
Fast, Warped Graph Embedding: Unifying Framework and One-Click AlgorithmPreprint
Chen, S., Niu, S., Akoglu, L., Kovačević, J., & Faloutsos, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05764 · Cited by 19
Self-citationGraphZero: Breaking Symmetry for Efficient Graph MiningPreprint
Mawhirter, D., Reinehr, S., Holmes, C., Liu, T., & Wu, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.12877 · Cited by 33
Patro, R., Duggal, G., Sefer, E., Wang, H., Filippova, D., & Kingsford, C. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339541 · Cited by 18
Diffusion archeology for diffusion progression history reconstruction
Sefer, E., & Kingsford, C. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-015-0904-x · Cited by 18
Community detection using preference networks
Tasgin, M., & Bingol, H. O. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.12.060 · Cited by 18
A systematic analysis and guidelines of graph neural networks for practical applications
Kim, J. Y., & Cho, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115466 · Cited by 19
EGraph: Efficient Concurrent GPU-based Dynamic Graph Processing
Zhang, Y., Liang, Y., Zhao, J., Mao, F., Gu, L., Liao, X., Jin, H., Liu, H., Guo, S., Zeng, Y., et al. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3171588 · Cited by 18
Zhu, J., Zhou, Y., Ioannidis, V. N., Qian, S., Ai, W., Song, X., & Koutra, D. (2024) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3616855.3635786 · Cited by 22
Detecting the Structure of Social Networks Using (α,β)-Communities
He, J., Hopcroft, J. E., Liang, H., Suwajanakorn, S., & Wang, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21286-4_3 · Cited by 18
Mining Knowledge from Data: An Information Network Analysis Approach
Han, J., Sun, Y., Yan, X., & Yu, P. S. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.145 · Cited by 18
Complex networks and social network analysis in information fusion
Svenson, P. (2006) · International Conference on Information Fusion (FUSION) · doi:10.1109/icif.2006.301554 · Cited by 18
Lee, K. H., Shao, B., & Kang, U. (2015) · Information Sciences · doi:10.1016/j.ins.2015.04.016 · Cited by 18
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
Habibulla, Y., Zhao, J.-H., & Zhou, H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19647-3_8 · Cited by 18
Sampling promotes community structure in social and information networks
Blagus, N., Šubelj, L., Weiß, G., & Bajec, M. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.03.048 · Cited by 18
Fast mining of complex time-stamped events
Tong, H., Sakurai, Y., Eliassi‐Rad, T., & Faloutsos, C. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458184 · Cited by 18
Self-citationSingle- and multi-level network sparsification by algebraic distance
John, E., & Safro, I. (2016) · Journal of Complex Networks · doi:10.1093/comnet/cnw025 · Cited by 18
Selfish Network Creation with Non-uniform Edge Cost
Chauhan, A., Lenzner, P., Melnichenko, A., & Molitor, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66700-3_13 · Cited by 18
COEUS: Community detection via seed-set expansion on graph streams
Liakos, P., Ntoulas, A., & Delis, A. (2017) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2017.8257983 · Cited by 18
Link Prediction Based on Community Information and Its Parallelization
Wang, J., Ma, Y., Liu, M., & Shen, W. (2019) · IEEE Access · doi:10.1109/access.2019.2907202 · Cited by 18
Graph Pooling with Representativeness
Li, J., Ma, Y., Wang, Y., Aggarwal, C. C., Wang, C., & Tang, J. (2020) · Proceedings · doi:10.1109/icdm50108.2020.00039 · Cited by 19
A User-Centric Mechanism for Sequentially Releasing Graph Datasets under Blowfish Privacy
Chicha, E., Bouna, B. A., Nassar, M., Chbeir, R., Haraty, R. A., Oussalah, M., Benslimane, D., & Alraja, M. N. (2021) · ACM Transactions on Internet Technology · doi:10.1145/3431501 · Cited by 18
A Space Efficient Scheme for Persistent Graph Representation
Kontopoulos, S., & Δρακόπουλος, Γ. (2014) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2014.52 · Cited by 18
Dynamic graph summarization: a tensor decomposition approach
Fernandes, S., Fanaee‐T, H., & da Gama, J. M. P. (2018) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-018-0583-9 · Cited by 18
Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees
He, H., & Singh, A. K. (2007) · Proceedings · doi:10.1109/icdm.2007.11 · Cited by 18
A Game Theoretical Approach to Modeling Information Dissemination in Social NetworksPreprint
Zinoviev, D. Y., Duong, V., & Zhang, H. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.5493 · Cited by 18
Averaging Gone Wrong: Using Time-Aware Analyses to Better Understand BehaviorPreprint
Barbosa, S., Cosley, D., Sharma, A. K., & Junior, R. M. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.07025 · Cited by 18
Blogging Around the Globe: Motivations, Privacy Concerns, and Social Networking
Kobayashi, M. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4051-1_3 · Cited by 19
Higher order graph centrality measures for Neo4j
Δρακόπουλος, Γ., Baroutiadi, A., & Megalooikonomou, V. (2015) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa.2015.7388097 · Cited by 17
Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs
McLaughlin, A., & Bader, D. A. (2015) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2015.10 · Cited by 17
Making Graphs Compact by Lossless Contraction
Fan, W., Li, Y., Liu, M., & Lu, C. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3452797 · Cited by 17
HyperDNE: Enhanced hypergraph neural network for dynamic network embedding
Huang, J., Tian, L., Zhou, X., Cheng, B. H., Hu, Z., Yu, W., & Xiao, J. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.01.039 · Cited by 19
Khuzdul: Efficient and Scalable Distributed Graph Pattern Mining Engine
Chen, J., & Qian, X. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3575743 · Cited by 17
Acer, U. G., Petros Drineas, B., & Abouzeid, A. A. (2010) · ACM International Workshop on Mobile Opportunistic Networking (MobiOpp) · doi:10.1145/1755743.1755761 · Cited by 17
Bonding vs. Bridging Social Capital: A Case Study in Twitter
Smith, M. S., & Giraud-Carrier, C. G. (2010) · doi:10.1109/socialcom.2010.62 · Cited by 19
Decoupling the design of identifier-to-locator mapping services from identifiers
Luo, H., Zhang, H., & Moshe Zukerman, D. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.12.009 · Cited by 17
Zhao, X., Liu, Q., Zheng, H.-T., & Zhao, B. Y. (2015) · Conference on Online Social Networks · doi:10.1145/2817946.2817956 · Cited by 17
Synthetic generation of social network data with endorsements
Pérez‐Rosés, H., & Sebé, F. (2014) · Journal of Simulation · doi:10.1057/jos.2014.29 · Cited by 17
RoundTripRank: Graph-based proximity with importance and specificity?
Fang, Y., Chang, K. C., & Lauw, H. W. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544860 · Cited by 17
Bound and exact methods for assessing link vulnerability in complex networks
Dinh, T. N., Thai, M. T., & Nguyen, H. P. N. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9742-0 · Cited by 17
Metadata
- Authors
- Leskovec, J., Kleinberg, J., & Faloutsos, C.
- Affiliations
- Carnegie Mellon University (US)
- Cornell University (US)
- Venue
- Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
- Publisher
- ACM
- Published
- 2005-08-21
- Pages
- 177-187
- OpenAlex
- W2111708605
- Cited by
- 2,281
- References
- 31
- Citations by year
- 2026: 42 · 2025: 88 · 2024: 78 · 2023: 79 · 2022: 85 · 2021: 135 · 2020: 118 · 2019: 128 · 2018: 146 · 2017: 127 · 2016: 157 · 2015: 164 · 2014: 166 · 2013: 168 · 2012: 155
- FWCI
- 77.15
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- graph evolution, network densification, superlinear growth, forest fire model, social networks, technological networks, information networks, small-world effect, degree distribution, community structure
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
