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 401–500 of 1,000
SSumM: Sparse Summarization of Massive Graphs
Lee, K., Jo, H., Ko, J., Lim, S., & Shin, K. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403057 · Cited by 47
Kostakos, V., O'Neill, E. J., Penn, A., Roussos, G., & Papadongonas, D. (2010) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1721831.1721833 · Cited by 66
Self-supervised Representation Learning on Dynamic Graphs
Tian, S. F., Wu, R., Shi, L., Liang, Z., & Xiong, T. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482389 · Cited by 47
Structure and Overlaps of Communities in NetworksPreprint
Yang, J., & Leskovec, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.6228 · Cited by 47
Self-citationMawhirter, D., Reinehr, S., Holmes, C., Liu, T., & Wu, B. (2021) · ACM SIGOPS Operating Systems Review · doi:10.1145/3469379.3469383 · Cited by 46
Comparing Information Diffusion Structure in Weblogs and Microblogs
Yang, J., & Counts, S. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14038 · Cited by 46
Network Theory in the Assessment of the Sustainability of Social–Ecological Systems
Gonzalès, R., & Parrott, L. (2012) · Geography Compass · doi:10.1111/j.1749-8198.2011.00470.x · Cited by 47
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
Svendsen, M. S., Mukherjee, A. P., & Tirthapura, S. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.08.011 · Cited by 46
Yin, H., Benson, A. R., & Leskovec, J. (2019) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3289600.3290991 · Cited by 50
Self-citationToward a distance oracle for billion-node graphs
Qi, Z., Xiao, Y., Shao, B., & Wang, H. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732219.2732225 · Cited by 45
Implicit affinity networks and social capital
Smith, M. X., Giraud-Carrier, C. G., & Purser, N. (2009) · Information Technology and Management · doi:10.1007/s10799-009-0057-2 · Cited by 45
Models of Online Social Networks
Bonato, A., Hadi, N., Horn, P., Prałat, P., & Wang, C. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10390642 · Cited by 44
The Dichotomy in Degree Correlation of Biological Networks
Hao, D., & Li, C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0028322 · Cited by 45
Joglekar, S. P., Sastry, N., Coulson, N., Taylor, S. J., Patel, A. K., Duschinsky, R., Anand, A., Evans, M. J., Griffiths, C., Sheikh, A., et al. (2018) · Journal of Medical Internet Research · doi:10.2196/jmir.9952 · Cited by 49
Link prediction in complex networks based on Significance of Higher-Order Path Index (SHOPI)
Kumar, A., Mishra, S., Singh, S. S., Singh, K., & Biswas, B. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.123790 · Cited by 47
Co-evolutionary dynamics in social networks: a case study of Twitter
Antoniades, D., & Dovrolis, C. (2015) · Computational Social Networks · doi:10.1186/s40649-015-0023-6 · Cited by 48
Park, Y., & Bader, J. S. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts211 · Cited by 45
Finding Dense Subgraphs in Relational Graphs
Jethava, V., & Beerenwinkel, N. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23525-7_39 · Cited by 44
Statistical Mechanics of the Minimum Dominating Set Problem
Zhao, J.-H., Habibulla, Y., & Zhou, H. (2015) · Journal of Statistical Physics · doi:10.1007/s10955-015-1220-2 · Cited by 44
Large human communication networks
Du, N., Faloutsos, C., Wang, B., & Akoglu, L. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557054 · Cited by 44
Self-citationStatistical Properties of Social Networks
McGlohon, M., Akoglu, L., & Faloutsos, C. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8462-3_2 · Cited by 44
Self-citationMulti-threaded modularity based graph clustering using the multilevel paradigm
LaSalle, D., & Karypis, G. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.09.012 · Cited by 43
Online estimating the k central nodes of a network
Lim, Y.-S., Menasché, D. S., Ribeiro, B., Towsley, D., & Basu, P. (2011) · IEEE Network Science Workshop (NSW) · doi:10.1109/nsw.2011.6004633 · Cited by 43
An Analysis of Verifications in Microblogging Social Networks -- Sina Weibo
Chen, J., & She, J. P. M. (2012) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2012.68 · Cited by 43
A survey on game theoretic models for community detection in social networks
Jonnalagadda, A., & Kuppusamy, L. (2016) · Social Network Analysis and Mining · doi:10.1007/s13278-016-0386-1 · Cited by 43
Trends Prediction Using Social Diffusion Models
Altshuler, Y., Pan, W., & Pentland, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29047-3_12 · Cited by 43
An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs
Shun, J. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783333 · Cited by 42
Dynamic Representation Learning via Recurrent Graph Neural Networks
Zhang, C.-Y., Yao, Z.-L., Yao, H.-Y., Huang, F., & Chen, C. L. P. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3196506 · Cited by 43
Benchmarking graph-processing platforms
Guo, Y., Vărbănescu, A. L., Iosup, A., Martella, C., & Willke, T. L. (2014) · ACM/SPEC International Conference on Performance Engineering (ICPE) · doi:10.1145/2568088.2576761 · Cited by 42
Lü, D., Li, Q., & Liao, S. S. (2012) · Decision Support Systems · doi:10.1016/j.dss.2011.12.003 · Cited by 43
Group and link analysis of multi-relational scientific social networks
Ströele, V., Zimbrão, G., & de Souza, J. M. (2013) · Journal of Systems and Software · doi:10.1016/j.jss.2013.02.024 · Cited by 42
Measuring the effects of preprocessing decisions and network forces in dynamic network analysis
Scripps, J., Tan, P., & Esfahanian, A. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557102 · Cited by 43
Discovering Communities and Anomalies in Attributed Graphs
Perozzi, B., & Akoglu, L. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3139241 · Cited by 44
How to predict social relationships — Physics-inspired approach to link prediction
Ashraf, A. W. U., Budka, M., & Musiał, K. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.04.246 · Cited by 43
Minimum budget for misinformation blocking in online social networks
Pham, C. V., Phu, Q. V., Hoang, H. X., Pei, J., & Thai, M. T. (2019) · Journal of Combinatorial Optimization · doi:10.1007/s10878-019-00439-5 · Cited by 42
Al-Andoli, M. N., Tan, S. C., Cheah, W. P., & Tan, S. Y. (2021) · IEEE Access · doi:10.1109/access.2021.3095335 · Cited by 44
Label propagation algorithm: a semi-synchronous approach
Cordasco, G., & Gargano, L. (2012) · International Journal of Social Network Mining · doi:10.1504/ijsnm.2012.045103 · Cited by 42
Han, Y., Zhou, B., Pei, J., & Jia, Y. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.95 · Cited by 42
GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space
He, H., & Singh, A. K. (2006) · Proceedings · doi:10.1109/icdm.2006.79 · Cited by 41
Tracking Influential Individuals in Dynamic Networks
Yang, Y., Wang, Z., Pei, J., & Chen, E. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2734667 · Cited by 41
Shang, R., Zhang, W., Jiao, L., Stolkin, R., & Xue, Y. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.11.066 · Cited by 41
Navlakha, S., Bar‐Joseph, Z., & Barth, A. L. (2017) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2017.09.012 · Cited by 43
Exploring the emergence of influential users on social media during natural disasters
Yang, Y., Zhang, C., Fan, C. H., Yao, W., Huang, R., & Mostafavi, A. (2019) · International Journal of Disaster Risk Reduction · doi:10.1016/j.ijdrr.2019.101204 · Cited by 40
Link prediction-based influence maximization in online social networks
Singh, A. K., & Kailasam, L. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.084 · Cited by 41
Temporal Scale of Processes in Dynamic Networks
Caceres, R. S., Berger-Wolf, T. Y., & Grossman, R. L. (2011) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2011.165 · Cited by 41
Faster Clustering Coefficient Using Vertex Covers
Green, O., & Bader, D. A. (2013) · International Conference on Social Computing · doi:10.1109/socialcom.2013.51 · Cited by 40
Jacobs, A. Z., Way, S. F., Ugander, J. H., & Clauset, A. J. (2015) · ACM Web Science Conference (WebSci) · doi:10.1145/2786451.2786477 · Cited by 45
Efficient top-k closeness centrality search
Olsen, P. W., Labouseur, A. G., & Hwang, J.-H. (2014) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2014.6816651 · Cited by 39
Rossi, R. A., Gallagher, B. J., Neville, J., & Henderson, K. A. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187980.2188234 · Cited by 40
Enumerating maximal cliques in temporal graphs
Himmel, A.-S., Molter, H., Niedermeier, R., & Sorge, M. (2016) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2016.7752255 · Cited by 40
Capturing associations in graphs
Fan, W., Jin, R., Liu, M., Lü, P., Tian, C., & Zhou, J. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407795 · Cited by 39
Context-aware Sampling of Large Networks via Graph Representation Learning
Zhou, Z., Shi, C., Shen, X., Cai, L., Wang, H., Liu, Y., Zhao, Y., & Chen, W. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3030440 · Cited by 40
Rank degree: An efficient algorithm for graph sampling
Voudigari, E., Salamanos, N., Papageorgiou, T., & Yannakoudakis, E. J. (2016) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2016.7752223 · Cited by 40
Graph Neural Networks: Methods, Applications, and OpportunitiesPreprint
Waikhom, L., & Patgiri, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.10733 · Cited by 40
Chakrabarti, D., & Faloutsos, C. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00449ed1v01y201209dmk006 · Cited by 49
Self-citationHeuristic Discovery of Role-Based Trust Chains in Peer-to-Peer Networks
Chen, K., Hwang, K., & Chen, G. (2008) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.60 · Cited by 39
DynGraphGAN: Dynamic Graph Embedding via Generative Adversarial Networks
Xiong, Y., Zhang, Y., Fu, H., Wang, W. W., Zhu, Y., & Yu, P. S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-18576-3_32 · Cited by 39
Patterns on the Connected Components of Terabyte-Scale Graphs
Kang, U., McGlohon, M., Akoglu, L., & Faloutsos, C. (2010) · Proceedings · doi:10.1109/icdm.2010.121 · Cited by 39
Self-citationEvolution of Social-Attribute Networks: Measurements, Modeling, and Implications using Google+Preprint
Gong, N. Z., Xu, W., Huang, L., Mittal, P., Stefanov, E., Sekar, V., & Song, D. X. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.0835 · Cited by 45
Diffusion Containment in Complex Networks Through Collective Influence of Connections
Liu, Y., Liang, G., Wang, X., Zhu, P., & Wang, Z. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3338423 · Cited by 38
Understanding Crowd-Powered Search Groups: A Social Network Perspective
Zhang, Q., Wang, F., Zeng, D. D., & Wang, T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0039749 · Cited by 38
Large-scale community detection based on node membership grade and sub-communities integration
Shang, R., Luo, S., Li, Y., Jiao, L., & Stolkin, R. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.02.004 · Cited by 38
Evolving collaboration networks in Scientometrics in 1978–2010: a micro–macro analysis
Chen, Y., Börner, K., & Fang, S. (2012) · Scientometrics · doi:10.1007/s11192-012-0895-2 · Cited by 38
A geographical analysis of knowledge production in computer science
Menezes, G. V., Ziviani, N., Laender, A. H. F., & Almeida, V. A. F. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526849 · Cited by 38
Fast Eigen-Functions Tracking on Dynamic Graphs
Chen, C., & Tong, H. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.63 · Cited by 38
Metric convergence in social network sampling
Doerr, C., & Blenn, N. (2013) · doi:10.1145/2491159.2491168 · Cited by 38
Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly Detection
Malliaros, F. D., Megalooikonomou, V., & Faloutsos, C. (2012) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.81 · Cited by 38
Self-citationSubgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph CollectionsPreprint
Ugander, J. H., Bäckström, L., & Kleinberg, J. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.1548 · Cited by 38
Self-citationThe Bursty Dynamics of the Twitter Information NetworkPreprint
Myers, S. A., & Leskovec, J. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.2732 · Cited by 38
Self-citationOn the Feasibility of Simple Transformer for Dynamic Graph Modeling
Wu, Y., Fang, Y., & Liao, L. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645622 · Cited by 37
Community Detection in Dynamic Social Networks: A Game-Theoretic Approach
Alvari, H., Hajibagheri, A., & Sukthankar, G. (2015) · Cited by 37
Socioscope: Human Relationship and Behavior Analysis in Social Networks
Zhang, H., Dantu, R., & Cangussu, J. W. (2011) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/tsmca.2011.2113335 · Cited by 37
Cluster Analysis and Optimization in Color-Based Clustering for Image Abstract
He, J., Huang, G., Zhang, Y., & Shi, Y. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.41 · Cited by 37
Experimental analysis of distributed graph systems
Ammar, K., & ÖZSU, M. T. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3231751.3231764 · Cited by 37
COEVOLVE: a joint point process model for information diffusion and network evolution
Farajtabar, M., Wang, Y., Gomez-Rodriguez, M., Li, S., Hongyuan Zha, B., & Song, L. (2017) · Journal of Machine Learning Research · Cited by 37
Wang, Q., Zheng, L., Huang, Y., Yao, P., Gui, C., Liao, X., Jin, H., Jiang, W., & Mao, F. (2021) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/3431920.3439288 · Cited by 37
Deep Learning for Dynamic Graphs: Models and Benchmarks
Gravina, A., & Bacciu, D. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3379735 · Cited by 45
Aliakbary, S., Motallebi, S., Rashidian, S., Habibi, J., & Movaghar, A. (2015) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4908605 · Cited by 36
High Impact Academic Paper Prediction Using Temporal and Topological Features
Davletov, F., Aydin, A. S., & Cakmak, A. (2014) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2661829.2662066 · Cited by 36
Degree relations of triangles in real-world networks and graph models
Durak, N., Pinar, A., Kolda, T. G., & Seshadhri, C. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2398503 · Cited by 36
Heuristics for Speeding Up Betweenness Centrality Computation
Puzis, R., Zilberman, P., Elovici, Y., Dolev, S., & Brandes, U. (2012) · International Conference on Social Computing · doi:10.1109/socialcom-passat.2012.66 · Cited by 36
Fully-Dynamic Approximation of Betweenness Centrality
Bergamini, E., & Meyerhenke, H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48350-3_14 · Cited by 36
Optimizing Topological Cascade Resilience Based on the Structure of Terrorist Networks
Gutfraind, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013448 · Cited by 36
Sattari, M., & Zamanifar, K. (2018) · Journal of Computational Science · doi:10.1016/j.jocs.2018.01.004 · Cited by 36
Rózemberczki, B., Kiss, O., & Sarkar, R. (2020) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3340531.3412758 · Cited by 42
Peng, H.-K., & Mărculescu, R. (2015) · PLoS ONE · doi:10.1371/journal.pone.0118309 · Cited by 36
On incremental maintenance of 2-hop labeling of graphs
Bramandia, R., Choi, B. K. K., & Ng, W. K. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367611 · Cited by 36
On Influential Nodes Tracking in Dynamic Social Networks
Chen, X., Song, G., He, X., & Xie, K. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.69 · Cited by 36
Edge Representation Learning with HypergraphsPreprint
Jo, J., Baek, J., Lee, S., Kim, D., Kang, M., & Hwang, S. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.15845 · Cited by 40
On the embeddability of random walk distances
Zhao, X., Chang, A., Sarma, A. D., Zheng, H.-T., & Zhao, B. Y. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2556549.2556554 · Cited by 35
Approximating Betweenness Centrality in Fully Dynamic Networks
Bergamini, E., & Meyerhenke, H. (2016) · Internet Mathematics · doi:10.1080/15427951.2016.1177802 · Cited by 35
Feature identification for predicting community evolution in dynamic social networks
İlhan, N., & Öğüdücü, Ş. G. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2016.06.003 · Cited by 35
Maximizing misinformation restriction within time and budget constraints
Pham, C. V., Thai, M. T., Duong, H. V., Bui, B. Q., & Hoang, H. X. (2018) · Journal of Combinatorial Optimization · doi:10.1007/s10878-018-0252-3 · Cited by 35
CAOM: A community-based approach to tackle opinion maximization for social networks
He, Q., Wang, X., Mao, F., Lv, J., Cai, Y., Huang, M., & Xu, Q. (2019) · Information Sciences · doi:10.1016/j.ins.2019.10.064 · Cited by 35
Evaluating Graph Vulnerability and Robustness using TIGER
Freitas, S., Yang, D., Kumar, S., Tong, H., & Chau, D. H. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482002 · Cited by 35
Link Prediction Based on Stochastic Information Diffusion
Vega‐Oliveros, D. A., Zhao, L., Rocha, A. D. R., & Berton, L. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3053263 · Cited by 35
Multi-Channel Pooling Graph Neural Networks
Du, J., Wang, S., Miao, H., & Zhang, J. (2021) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/199 · Cited by 35
User Groups in Social Networks: An Experimental Study on YouTube
Laine, M. S. S., Ercal, G., & Luo, B. (2011) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2011.472 · Cited by 35
Information in Digital, Economic and Social NetworksPreprint
Sundararajan, A., Provost, F. J., Oestreicher-Singer, G., & Aral, S. (2012) · SSRN Electronic Journal · doi:10.2139/ssrn.2141682 · Cited by 35
On Graph Deltas for Historical QueriesPreprint
Koloniari, G., Souravlias, D., & Pitoura, E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.5549 · Cited by 35
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
