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
Flagged first, then by citations
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 101–200 of 1,000
Efficient Core Maintenance in Large Dynamic Graphs
Li, R.-H., Yu, J. X., & Mao, R. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.158 · Cited by 188
The diameter of opportunistic mobile networks
Chaintreau, A., Mtibaa, A., Massoulié, L., & Diot, C. (2007) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/1364654.1364670 · Cited by 185
Supervised Random Walks: Predicting and Recommending Links in Social NetworksPreprint
Bäckström, L., & Leskovec, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.4071 · Cited by 192
Self-citationSybilBelief: A Semi-Supervised Learning Approach for Structure-Based Sybil Detection
Gong, N. Z., Frank, M., & Mittal, P. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2014.2316975 · Cited by 178
Berlingerio, M., Bonchi, F., Bringmann, B., & Gionis, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04180-8_25 · Cited by 179
Maiya, A. S., & Berger-Wolf, T. Y. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772762 · Cited by 179
Modeling dynamic behavior in large evolving graphs
Rossi, R. A., Gallagher, B. J., Neville, J., & Henderson, K. A. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433479 · Cited by 177
Identifying optimal targets of network attack by belief propagation
Mugisha, S., & Zhou, H. (2016) · Physical review. E · doi:10.1103/physreve.94.012305 · Cited by 176
Tracking community evolution in social networks: A survey
Dakiche, N., Tayeb, F. B.-S., Slimani, Y., & Benatchba, K. (2018) · Information Processing & Management · doi:10.1016/j.ipm.2018.03.005 · Cited by 179
SoK: The Evolution of Sybil Defense via Social Networks
Alvisi, L., Clement, A., Epasto, A., Lattanzi, S., & Panconesi, A. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.33 · Cited by 177
On the privacy of anonymized networks
Pedarsani, P., & Grossglauser, M. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020596 · Cited by 173
Fast computation of SimRank for static and dynamic information networks
Li, C., Han, J., He, G., Jin, X. Y., Sun, Y., Yu, Y., & Wu, T. (2010) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1739041.1739098 · Cited by 173
Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402963 · Cited by 173
Measurement-calibrated graph models for social network experiments
Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H.-T., & Zhao, B. Y. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772778 · Cited by 174
Inferring social network structure in ecological systems from spatio-temporal data streams
Psorakis, I., Roberts, S. J., Rezek, I., & Sheldon, B. C. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2012.0223 · Cited by 171
Evolution of social-attribute networks
Gong, N. Z., Xu, W., Huang, L., Mittal, P., Stefanov, E., Sekar, V., & Song, D. X. (2012) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2398776.2398792 · Cited by 172
Scientific discovery and topological transitions in collaboration networks
Bettencourt, L. M. A., Kaiser, D. I., & Kaur, J. (2009) · Journal of Informetrics · doi:10.1016/j.joi.2009.03.001 · Cited by 164
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281290 · Cited by 171
Fast and simple decycling and dismantling of networks
Zdeborová, L., Zhang, P., & Zhou, H.-J. (2016) · Scientific Reports · doi:10.1038/srep37954 · Cited by 166
Han, W., Miao, Y., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, W., & Chen, E. (2014) · European Conference on Computer Systems · doi:10.1145/2592798.2592799 · Cited by 161
UTS: An Unbalanced Tree Search Benchmark
Olivier, S. L., Huan, J., Liu, J., Prins, J. F., Dinan, J., Sadayappan, P., & Tseng, C. (2007) · Springer eBooks · doi:10.1007/978-3-540-72521-3_18 · Cited by 159
Scalable Anomaly Ranking of Attributed Neighborhoods
Perozzi, B., & Akoglu, L. (2016) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974348.24 · Cited by 159
Detection of Overlapping Communities in Dynamical Social Networks
Cazabet, R., Amblard, F., & Hanachi, C. (2010) · doi:10.1109/socialcom.2010.51 · Cited by 159
Multiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-18009-5_7 · Cited by 155
Self-citationOn compact routing for the internet
Krioukov, D., claffy, K., Fall, K., & Brady, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273450 · Cited by 155
Fast and accurate estimation of shortest paths in large graphs
Gubichev, A., Bedathur, S., Seufert, S., & Weikum, G. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871503 · Cited by 154
Communication Network Evolution in Organizational Communities
Monge, P. R., Heiss, B. M. R., & Margolin, D. (2008) · Communication Theory · doi:10.1111/j.1468-2885.2008.00330.x · Cited by 150
LLAMA: Efficient graph analytics using Large Multiversioned Arrays
Macko, P., Marathe, V. J., Margo, D., & Seltzer, M. (2015) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2015.7113298 · Cited by 151
On the bias of BFS (Breadth First Search)
Kurant, M., Markopoulou, A. P., & Thiran, P. (2010) · International Teletraffic Congress · doi:10.1109/itc.2010.5608727 · Cited by 151
Kurant, M., Markopoulou, A. P., & Thiran, P. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.111005 · Cited by 150
Kwak, H., Chun, H., & Moon, S. B. (2011) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/1978942.1979104 · Cited by 153
Bounova, G., & Weck, O. L. D. (2012) · Physical Review E · doi:10.1103/physreve.85.016117 · Cited by 149
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms
Prakash, B. A., Tong, H., Valler, N. C., Faloutsos, M., & Faloutsos, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15939-8_7 · Cited by 145
Self-citationMulti-Topic Misinformation Blocking With Budget Constraint on Online Social Networks
Pham, D. V., Giang, N. L., Nguyen, T. N., Pham, C. V., & Nguyen, A. V. (2020) · IEEE Access · doi:10.1109/access.2020.2989140 · Cited by 145
Temporal Network Embedding with Micro- and Macro-dynamics
Lu, Y., Wang, X., Shi, C., Yu, P. S., & Ye, Y. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3357943 · Cited by 143
Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
Zhang, Y., & Parthasarathy, S. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.35 · Cited by 142
Data mining of social networks represented as graphs
Nettleton, D. (2013) · Computer Science Review · doi:10.1016/j.cosrev.2012.12.001 · Cited by 153
Learning and Predicting the Evolution of Social Networks
Bringmann, B., Berlingerio, M., Bonchi, F., & Gionis, A. (2010) · IEEE Intelligent Systems · doi:10.1109/mis.2010.91 · Cited by 141
Graph Data Anonymization, De-Anonymization Attacks, and De-Anonymizability Quantification: A Survey
Ji, S., Mittal, P., & Beyah, R. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2633620 · Cited by 149
Analysing the connectivity and communication of suicidal users on twitter
Colombo, G. B., Burnap, P., Hodorog, A., & Scourfield, J. (2015) · Computer Communications · doi:10.1016/j.comcom.2015.07.018 · Cited by 147
Meng, X., Kamara, S., Kobbi Nissim, B., & Kollios, G. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813672 · Cited by 146
High-order Proximity Preserved Embedding For Dynamic Networks
Zhu, D., Cui, P., Zhang, Z., Pei, J., & Zhu, W. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2822283 · Cited by 138
Ugander, J. H., Bäckström, L., & Kleinberg, J. M. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488502 · Cited by 137
Self-citationHow to partition a billion-node graph
Wang, L., Xiao, Y., Shao, B., & Wang, H. (2014) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2014.6816682 · Cited by 136
Tiles: an online algorithm for community discovery in dynamic social networks
Rossetti, G., Pappalardo, L., Pedreschi, D., & Giannotti, F. (2016) · Machine Learning · doi:10.1007/s10994-016-5582-8 · Cited by 136
Non-Negative Residual Matrix Factorization with Application to Graph Anomaly Detection
Tong, H., & Lin, C.-Y. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.13 · Cited by 135
LabelRank: A stabilized label propagation algorithm for community detection in networks
Xie, J., & Szymanski, B. K. (2013) · IEEE Network Science Workshop (NSW) · doi:10.1109/nsw.2013.6609210 · Cited by 135
Link prediction in paper citation network to construct paper correlation graph
Liu, H., Kou, H., Yan, C., & Qi, L. (2019) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-019-1561-7 · Cited by 135
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value DecompositionPreprint
Musco, C., & Musco, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.05477 · Cited by 134
SNAP: A General Purpose Network Analysis and Graph Mining LibraryPreprint
Leskovec, J., & Sosič, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.07550 · Cited by 134
Self-citationScalable Large Near-Clique Detection in Large-Scale Networks via Sampling
Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C. E., & Xu, S. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783385 · Cited by 133
Waikhom, L., & Patgiri, R. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-022-10321-2 · Cited by 228
Evolution of resilience in protein interactomes across the tree of life
Zitnik, M., Sosič, R., Feldman, M. W., & Leskovec, J. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1818013116 · Cited by 130
Self-citationA Survey and Taxonomy of Graph SamplingPreprint
Hu, P., & Lau, W. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5865 · Cited by 188
Mining and Visualizing the Evolution of Subgroups in Social Networks
Falkowski, T., Bartelheimer, J., & Spiliopoulou, M. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.118 · Cited by 127
Berahmand, K., Bouyer, A., & Vasighi, M. (2018) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2018.2879494 · Cited by 126
DFacTo: Distributed Factorization of TensorsPreprint
Choi, J. H., & Vishwanathan, S. V. N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4519 · Cited by 131
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
Slota, G. M., Rajamanickam, S., & Madduri, K. (2014) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2014.64 · Cited by 124
Keep your friends close: Incorporating trust into social network-based Sybil defenses
Mohaisen, A., Hopper, N., & Kim, Y. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5934998 · Cited by 123
Link analysis for Web spam detection
Becchetti, L., Castillo, C., Donato, D., Baeza-Yates, R. A., & Leonardi, S. (2008) · ACM Transactions on the Web · doi:10.1145/1326561.1326563 · Cited by 121
Parallel SimRank computation on large graphs with iterative aggregation
He, G., Feng, H., Li, C., & Chen, H. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835874 · Cited by 121
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Sun, J., Xie, Y., Zhang, H., & Faloutsos, C. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.33 · Cited by 121
Self-citationCommunity detection: Topological vs. topical
Ding, Y. (2011) · Journal of Informetrics · doi:10.1016/j.joi.2011.02.006 · Cited by 123
Flooding time in edge-Markovian dynamic graphs
Clementi, A. E. F., Macci, C., Monti, A., Pasquale, F., & Silvestri, R. (2008) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1400751.1400781 · Cited by 119
Shi, X., Adamic, L. A., & Strauss, M. J. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.11.072 · Cited by 119
Lattanzi, S., & Sivakumar, D. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536474 · Cited by 119
Temporal Analysis of the Wikigraph
Buriol, L. S., Castillo, C., Donato, D., Leonardi, S., & Millozzi, S. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.164 · Cited by 119
Social Network Analysis, Overview of
Scott, J. P. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_178 · Cited by 119
Co-evolution of social and affiliation networks
Zheleva, E., Sharara, H., & Getoor, L. C. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557128 · Cited by 116
COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolutionPreprint
Farajtabar, M., Wang, Y., Gomez-Rodriguez, M., Li, S., Hongyuan Zha, B., & Song, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.02293 · Cited by 116
Research Commentary —Information in Digital, Economic, and Social Networks
Sundararajan, A., Provost, F. J., Oestreicher-Singer, G., & Aral, S. (2013) · Information Systems Research · doi:10.1287/isre.1120.0472 · Cited by 117
Mawhirter, D., & Wu, B. (2019) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3341301.3359633 · Cited by 115
Structure and Overlaps of Ground-Truth Communities in Networks
Yang, J., & Leskovec, J. (2014) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2594454 · Cited by 176
Self-citationDiscovering frequent subgraphs over uncertain graph databases under probabilistic semantics
Zou, Z., Gao, H., & Li, J. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835885 · Cited by 113
Xie, J., Chen, M., & Szymanski, B. K. (2013) · doi:10.1145/2489247.2489249 · Cited by 117
Mining Periodic Behavior in Dynamic Social Networks
Lahiri, M., & Berger-Wolf, T. Y. (2008) · Proceedings · doi:10.1109/icdm.2008.104 · Cited by 112
Weighted graphs and disconnected components
McGlohon, M., Akoglu, L., & Faloutsos, C. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401955 · Cited by 111
Self-citationDynamic Social Community Detection and Its Applications
Nguyen, N. P., Dinh, T. N., Shen, Y., & Thai, M. T. (2014) · PLoS ONE · doi:10.1371/journal.pone.0091431 · Cited by 111
Random Hyperbolic Graphs: Degree Sequence and Clustering
Gugelmann, L., Παναγιώτου, Κ., & Peter, U. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31585-5_51 · Cited by 110
Onuma, K., Tong, H., & Faloutsos, C. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557093 · Cited by 112
Self-citationGUISE: Uniform Sampling of Graphlets for Large Graph Analysis
Bhuiyan, M. A., Rahman, M., Rahman, M., & Hasan, M. A. (2012) · Proceedings · doi:10.1109/icdm.2012.87 · Cited by 110
Holistic Influence Maximization
Galhotra, S., Arora, A., & Roy, S. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882929 · Cited by 110
Network Archaeology: Uncovering Ancient Networks from Present-Day Interactions
Navlakha, S., & Kingsford, C. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001119 · Cited by 109
Power grid complex network evolutions for the smart grid
Pagani, G. A., & Aiello, M. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.11.022 · Cited by 133
Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1402958.1402963 · Cited by 109
A Study of the Human Flesh Search Engine: Crowd-Powered Expansion of Online Knowledge
Wang, F., Zeng, D. D., Hendler, J., Zhang, Q., Feng, Z., Gao, Y., Wang, H., & Lai, G. (2010) · Computer · doi:10.1109/mc.2010.216 · Cited by 107
Maiya, A. S., & Berger-Wolf, T. Y. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020431 · Cited by 107
Huang, J. L., Zhuang, Z., Li, J., & Giles, C. L. (2008) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1341531.1341548 · Cited by 107
How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis
Guo, Y., Biczak, M., Vărbănescu, A. L., Iosup, A., Martella, C., & Willke, T. L. (2014) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2014.49 · Cited by 106
Self-Supervised Temporal Graph Learning With Temporal and Structural Intensity Alignment
Liu, M., Liang, K., Zhao, Y., Tu, W., Zhou, S., Gan, X., Liu, X., & He, K. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3386168 · Cited by 121
How does the data sampling strategy impact the discovery of information diffusion in social media?
De Choudhury, M., Lin, Y.-R., Sundaram, H., Candan, K. S., Xie, L., & Kelliher, A. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14024 · Cited by 209
Self-similar scaling of density in complex real-world networks
Blagus, N., Šubelj, L., & Bajec, M. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.055 · Cited by 105
Tong, H., Papadimitriou, S., Sun, J., Yu, P. S., & Faloutsos, C. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401973 · Cited by 105
Self-citationNetSimile: A Scalable Approach to Size-Independent Network SimilarityPreprint
Berlingerio, M., Koutra, D., Eliassi‐Rad, T., & Faloutsos, C. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.2684 · Cited by 105
Self-citationFast computation of empirically tight bounds for the diameter of massive graphs
Magnien, C., Matthieu Latapy, B., & Habib, M. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1455266 · Cited by 104
Multiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.625257 · Cited by 104
Self-citationExploring the structure and function of temporal networks with dynamic graphlets
Hulovatyy, Y., Chen, H., & Milenković, T. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv227 · Cited by 103
Data-driven analysis of Bitcoin properties: exploiting the users graph
Maesa, D. D. F., Marino, A., & Ricci, L. (2017) · International Journal of Data Science and Analytics · doi:10.1007/s41060-017-0074-x · Cited by 99
Strategies to Utilize the Positive Emotional Contagion Optimally in Crowd Evacuation
Zhang, G., Lu, D., & Liu, H. (2018) · IEEE Transactions on Affective Computing · doi:10.1109/taffc.2018.2836462 · Cited by 103
Community mining on dynamic weighted directed graphs
Duan, D., Li, Y., Jin, Y., & Lu, Z. (2009) · doi:10.1145/1651274.1651278 · Cited by 101
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
