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 801–900 of 1,000
Nazir, A., Waagen, A., Vijayaraghavan, V. S., Chuah, C., D’Souza, R. M., & Krishnamurthy, B. (2012) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2398776.2398826 · Cited by 17
Analyzing Leadership Dynamics in Distributed Group Communication
Crowston, K., Wiggins, A., & Howison, J. (2010) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2010.62 · Cited by 17
Benford’s Distribution in Complex Networks
Morzy, M., Kajdanowicz, T. J., & Szymanski, B. K. (2016) · Scientific Reports · doi:10.1038/srep34917 · Cited by 17
Rank degree: an efficient algorithm for graph sampling
Voudigari, E., Salamanos, N., Papageorgiou, T., & Yannakoudakis, E. J. (2016) · Advances in Social Networks Analysis and Mining · doi:10.5555/3192424.3192447 · Cited by 15
RETRACTED: An event detection method for social networks based on link prediction
Hu, W., Wang, H., Peng, C. Y., Liang, H., & Du, B. (2017) · Information Systems · doi:10.1016/j.is.2017.06.003 · Cited by 17
RetractedAdult Content in Social Live Streaming Services: Characterizing Deviant Users and Relationships
Lykousas, N., Gómez, V., & Patsakis, C. (2018) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2018.8508246 · Cited by 17
Martín-Gutíerrez, S., Losada, J. C., & Benito, R. M. (2018) · Complexity · doi:10.1155/2018/2413481 · Cited by 17
Listing All Maximal k-Plexes in Temporal Graphs
Bentert, M., Himmel, A.-S., Molter, H., Morik, M., Niedermeier, R., & Saitenmacher, R. (2018) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2018.8508847 · Cited by 17
Classes of critical avalanche dynamics in complex networks
Radicchi, F., Castellano, C., Flammini, A., Muñoz, M. A., & Notarmuzi, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033171 · Cited by 18
Jiang, W., Pan, S., Lu, C., Zhao, Z., Lin, S., Xiong, M., & He, Z. (2021) · International Journal of Intelligent Systems · doi:10.1002/int.22673 · Cited by 17
Distributed Community Detection with the WCC Metric
Saltz, M., Prat-Pèrez, A., & Domínguez-Sal, D. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2740908.2744715 · Cited by 17
Characterizing and predicting community members from evolutionary and heterogeneous networks
Zhao, Q., Bhowmick, S. S., Zheng, X., & Yi, K. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458125 · Cited by 17
Revenue maximization in social networks through discounting
Babaei, M., Mirzasoleiman, B., Jalili, M., & Safari, M. A. (2012) · Social Network Analysis and Mining · doi:10.1007/s13278-012-0085-5 · Cited by 17
Scaling behaviours in the growth of networked systems and their geometric origins
Zhang, J., Li, X., Wang, X., Wang, W.-X., & Wu, L. (2015) · Scientific Reports · doi:10.1038/srep09767 · Cited by 17
Beyond centrality—classifying topological significance using backup efficiency and alternative paths
Shavitt, Y., & Singer, Y. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/8/266 · Cited by 17
Wührer, G. A., & Smejkal, A. E. (2012) · Scientometrics · doi:10.1007/s11192-012-0909-0 · Cited by 17
The diffusion of networking technologies
Goldberg, S., & Liu, Z. (2013) · doi:10.5555/2627817.2627930 · Cited by 17
Luna, J. M. (2021) · Springer eBooks · doi:10.1007/978-981-16-3964-7_1 · Cited by 18
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret MinimizationPreprint
Hopkins, S. B., Li, J. Z., & Zhang, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.15839 · Cited by 17
A Large-Scale Database for Graph Representation LearningPreprint
Freitas, S., Dong, Y., Neil, J., & Chau, D. H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.07682 · Cited by 41
Graph Neural Networks with Node-wise Architecture
Wang, Z., Wei, Z., Li, Y., Kuang, W., & Ding, B. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539387 · Cited by 16
DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition
Chen, J., & Qian, X. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3567955.3567956 · Cited by 16
Qin, M., Zhang, C., Bai, B. B., Zhang, G., & Yeung, D. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3596605 · Cited by 16
Huang, S., Wang, P., Hua, Z., Dong, Y., & Shi, J. (2024) · Journal of Hydrology · doi:10.1016/j.jhydrol.2024.131577 · Cited by 16
A social network model driven by events and interests
Sun, X., Lin, H., & Xu, K. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.01.020 · Cited by 16
Partial view selection for evolving social graphs
Koloniari, G., & Pitoura, E. (2013) · ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) (GRADES-NDA) · doi:10.1145/2484425.2484434 · Cited by 16
Evolution-Cast: Temporal Evolution in Wireless Social Networks and Its Impact on Capacity
Fu, L., Zhang, J., & Wang, X. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.237 · Cited by 16
Inference of Hidden Social Power Through Opinion Formation in Complex Networks
Sichani, O. A., & Jalili, M. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2691405 · Cited by 16
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
Hamann, M., Meyer, U., Penschuck, M., Tran, H., & Wagner, D. (2018) · ACM Journal of Experimental Algorithmics · doi:10.1145/3230743 · Cited by 16
Approximations of the Generalized Cascade Model
Bóta, A., Krész, M., & Pluhár, A. (2013) · Acta Cybernetica · doi:10.14232/actacyb.21.1.2013.4 · Cited by 16
A Graph Resilience Metric Based On Paths: Higher Order Analytics With GPU
Δρακόπουλος, Γ., Liapakis, X., Tzimas, G. E., & Phivos Mylonas, B. (2018) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2018.00138 · Cited by 16
Graph sampling for Internet topologies using normalized Laplacian spectral features
Jiao, B., Shi, J., Zhang, W., & Xing, L. (2019) · Information Sciences · doi:10.1016/j.ins.2018.12.073 · Cited by 16
Inductive and Unsupervised Representation Learning on Graph Structured Objects
Wang, L., Zong, B., Ma, Q., Cheng, W. D., Ni, J., Yu, W., Liu, Y., Song, D., Chen, H., & Fu, Y. (2020) · International Conference on Learning Representations · Cited by 19
Chen, H., Shen, M., Xiao, N., & Lu, Y. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476159 · Cited by 16
Generative model selection using a scalable and size-independent complex network classifier
Motallebi, S., Aliakbary, S., & Habibi, J. (2013) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4840235 · Cited by 16
Qu, Y., Guan, X., Zheng, Q., Liu, T., Zhou, J., & Li, J. (2015) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/2693208.2693223 · Cited by 16
Set-based unified approach for summarization of a multi-attributed graph
Khan, K. U., Nawaz, W., & Lee, Y.-K. (2016) · World Wide Web · doi:10.1007/s11280-016-0388-y · Cited by 16
Large-scale clique cover of real-world networks
Conte, A., Grossi, R., & Marino, A. (2019) · Information and Computation · doi:10.1016/j.ic.2019.104464 · Cited by 16
Graph transformer networks based text representation
Mei, X., Cai, X., Yang, L., & Wang, N. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.08.032 · Cited by 17
Techniques for analyzing dynamic random graph models of web‐like networks: An overview
Cami, A., & Deo, N. (2007) · Networks · doi:10.1002/net.20215 · Cited by 16
An Economically-Principled Generative Model of AS Graph Connectivity
Corbo, J., Jain, S., Mitzenmacher, M., & Parkes, D. C. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062263 · Cited by 16
Follow Whom? Chinese Users Have Different ChoicePreprint
Chen, Z., Liu, P., Wang, X., & Gu, Y. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.0167 · Cited by 16
Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and ApplicationsPreprint
Chen, P., Wu, L., Liu, S., & Rajapakse, I. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11769 · Cited by 18
Evolution of Ethereum: A Temporal Graph PerspectivePreprint
Bai, Q., Zhang, C., Xu, Y., Chen, X., & Wang, X. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.05251 · Cited by 16
Discovering the Influences of Complex Network Effects on Recovering Large Scale Multiagent Systems
Xu, Y., Liu, P., Li, X., & Ren, W. (2014) · The Scientific World JOURNAL · doi:10.1155/2014/407639 · Cited by 15
Fake News Propagation and Mitigation Techniques: A Survey
Saxena, A., Saxena, P., & Reddy, H. (2021) · Smart innovation, systems and technologies · doi:10.1007/978-981-16-3398-0_16 · Cited by 15
Disrupting networks of hate: characterising hateful networks and removing critical nodes
Alorainy, W., Burnap, P., Liu, H., Williams, M., & Giommoni, L. (2022) · Social Network Analysis and Mining · doi:10.1007/s13278-021-00818-z · Cited by 15
Maximizing fair content spread via edge suggestion in social networks
Swift, I. P., Ebrahimi, S., Nova, A., & Asudeh, A. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3551793.3551824 · Cited by 15
MaNIACS : Approximate Mining of Frequent Subgraph Patterns through Sampling
Preti, G., Morales, G. D. F., & Riondato, M. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3587254 · Cited by 15
GraphSet: High Performance Graph Mining through Equivalent Set Transformations
Shi, T., Zhai, J., Wang, H., Chen, Q., Zhai, M., Hao, Z., Yang, H., & Chen, W. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3613213 · Cited by 15
MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set Problem
Okumuş, F., & Karcı, Ş. (2024) · Applied Sciences · doi:10.3390/app14209251 · Cited by 15
Expansion Properties of Large Social Graphs
Malliaros, F. D., & Megalooikonomou, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20244-5_30 · Cited by 15
Optimizing social media message dissemination problem for emergency communication
Ma, X., & Yates, J. (2014) · Computers & Industrial Engineering · doi:10.1016/j.cie.2014.09.016 · Cited by 15
Cuzzocrea, A., Folino, F., & Pizzuti, C. (2013) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1145/2513591.2513658 · Cited by 15
Extracting the Core Structure of Social Networks Using (α, β)-Communities
Wang, L., Hopcroft, J. E., He, J., Liang, H., & Suwajanakorn, S. (2013) · Internet Mathematics · doi:10.1080/15427951.2012.678187 · Cited by 15
Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks
Wegner, A. E. (2014) · Physical Review X · doi:10.1103/physrevx.4.041026 · Cited by 15
An Efficient Patch Dissemination Strategy for Mobile Networks
Zhao, D., Peng, H., Li, L., Yang, Y., & Li, S. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/896187 · Cited by 15
Modeling/predicting the evolution trend of osn-based applications
Liu, H., Nazir, A., Joung, J., & Chuah, C. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488456 · Cited by 15
A Probabilistic Machine Learning Approach to Scheduling Parallel Loops With Bayesian Optimization
Kim, K., Kim, Y., & Park, S. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3046461 · Cited by 15
Exploiting Network Structure for Active Inference in Collective Classification
Rattigan, M. J., Maier, M. E., & Jensen, D. D. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.124 · Cited by 15
Preti, G., Morales, G. D. F., & Riondato, M. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467344 · Cited by 15
Personalized Graph Summarization: Formulation, Scalable Algorithms, and Applications
Kang, S., Lee, K., & Shin, K. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00219 · Cited by 15
Bayesian mixed-membership models of complex and evolving networks
Fienberg, S. E., Carley, K. M., & Airoldi, E. M. (2006) · Cited by 16
Multi-graph learning of spectral graph dictionaries
Thanou, D., & Pascal Frossard, B. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178601 · Cited by 15
Structure and Dynamics of Information in Networks
Kempe, D. (2010) · Cited by 14
Chen, Y., & Fang, S. (2014) · Scientometrics · doi:10.1007/s11192-014-1304-9 · Cited by 15
An Empirical Study of User Behaviors on Pinterest Social Network
Feng, Z., Feng, C., Chen, K., & Yu, Y. (2013) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat.2013.57 · Cited by 16
An analysis of social gaming networks in online and face to face bridge communities
Balint, M., Posea, V., Dimitriu, A., & Iosup, A. (2011) · doi:10.1145/1996029.1996038 · Cited by 15
Mining diversity on social media networks
Liu, L., Zhu, F., Jiang, M., Han, J., Sun, L., & Yang, S. (2010) · Multimedia Tools and Applications · doi:10.1007/s11042-010-0568-1 · Cited by 15
Self-Similarity in Social Network Dynamics
Liu, Q., Zhao, X., Willinger, W., Wang, X., Zhao, B. Y., & Zheng, H.-T. (2016) · ACM Transactions on Modeling and Performance Evaluation of Computing Systems · doi:10.1145/2994142 · Cited by 15
Optimizing controllability of edge dynamics in complex networks by perturbing network structure
Pang, S., & Hao, F. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.12.001 · Cited by 15
On the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms
Chen, C., & Tong, H. (2016) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11310 · Cited by 15
A streaming sampling algorithm for social activity networks using fixed structure learning automata
Ghavipour, M., & Meybodi, M. R. (2017) · Applied Intelligence · doi:10.1007/s10489-017-1005-1 · Cited by 15
Walk-Steered Convolution for Graph Classification
Jiang, J., Xu, C., Cui, Z., Zhang, T., Zheng, W., & Yang, J. J. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2956095 · Cited by 15
Measuring directed triadic closure with closure coefficients
Yin, H., Benson, A. R., & Ugander, J. H. (2020) · Network Science · doi:10.1017/nws.2020.20 · Cited by 15
NODE MIXING AND GROUP STRUCTURE OF COMPLEX SOFTWARE NETWORKS
Šubelj, L., Žitnik, S., Blagus, N., & Bajec, M. (2014) · RePEc: Research Papers in Economics · Cited by 15
Measuring directed triadic closure with closure coefficients
Yin, H., Benson, A. R., & Ugander, J. H. (2020) · RePEc: Research Papers in Economics · Cited by 15
Conditional adjacency anonymity in social graphs under active attacks
Mauw, S., Ramírez-Cruz, Y., & Trujillo-Rasúa, R. (2018) · Knowledge and Information Systems · doi:10.1007/s10115-018-1283-x · Cited by 15
Social groups and social network formation
Tarbush, B., & Teytelboym, A. (2015) · Games and Economic Behavior · doi:10.1016/j.geb.2015.11.004 · Cited by 15
Smith, M. S. (2007) · ScholarsArchive (Brigham Young University) · Cited by 15
Decentralised network prediction and reconstruction algorithms
Yuan, Y. (2012) · Apollo (University of Cambridge) · doi:10.17863/cam.14023 · Cited by 16
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian ModelPreprint
Fan, Z., Mao, C., Wu, Y., & Xu, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.08880 · Cited by 15
Generating Synthetic Social Graphs with Darwini
Edunov, S., Logothetis, D., Wang, C., Ching, A., & Kabiljo, M. (2018) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2018.00062 · Cited by 14
Multi-core on-the-fly SCC decomposition
Bloemen, V., Laarman, A., & van de Pol, J. (2016) · ACM SIGPLAN Notices · doi:10.1145/3016078.2851161 · Cited by 14
Variational Graph Author Topic Modeling
Zhang, D. C., & Lauw, H. W. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539310 · Cited by 16
Evolving Network Modeling Driven by the Degree Increase and Decrease Mechanism
Li, Y., Feng, M., & Kurths, J. (2023) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2023.3268372 · Cited by 14
Individual-centralized seeding strategy for influence maximization in information-limited networks
Liu, Y., Wang, X., Wang, X., Li, Y., Zhao, S., & Wang, Z. (2024) · Journal of The Royal Society Interface · doi:10.1098/rsif.2023.0625 · Cited by 14
Ding, P., Zhang, J., Zhang, P., Lv, Y., & Wang, D. (2024) · Advanced Engineering Informatics · doi:10.1016/j.aei.2024.102957 · Cited by 14
Network Compression as a Quality Measure for Protein Interaction Networks
Royer, L. A., Reimann, M., Stewart, A. F., & Schroeder, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0035729 · Cited by 14
Co-evolutionary Dynamics in Social Networks: A Case Study of Twitter
Antoniades, D., & Dovrolis, C. (2014) · International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) · doi:10.1109/sitis.2014.68 · Cited by 17
Predicting aggregate social activities using continuous-time stochastic process
Huang, S. R., Chen, M., Luo, B., & Lee, D. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396885 · Cited by 14
Metrics and Models for Social Networks
Bersano-Méndez, N. I., Schaeffer, S. E., & Bustos-Jiménez, J. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4048-1_5 · Cited by 14
Notice of Removal March 3, 2026: Inferring Dynamic Diffusion Networks in Online Media
Tahani, M., Hemmatyar, A. M. A., Rabiee, H. R., & Ramezani, M. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2882968 · Cited by 14
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Kajdanowicz, T. J., & Morzy, M. (2016) · Entropy · doi:10.3390/e18090320 · Cited by 14
Quantum walk search on Kronecker graphs
Wong, T. G., Wünscher, K., Lockhart, J., & Simone Severini, B. (2018) · Physical Review A · doi:10.1103/physreva.98.012338 · Cited by 13
Identifying vital nodes based on reverse greedy method
Ren, T., Li, Z., Qi, Y., Zhang, Y., Liu, S., Xu, Y., & Zhou, T. (2020) · Scientific Reports · doi:10.1038/s41598-020-61722-8 · Cited by 14
AURORA: Auditing PageRank on Large Graphs
Kang, J. L., Wang, M., Cao, N., Xia, Y., Fan, W., & Tong, H. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622563 · Cited by 14
Network Immunization Strategy by Eliminating Fringe Nodes: A Percolation Perspective
Liu, G., Deng, Y., & Cheong, K. H. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3207319 · Cited by 14
Fast centrality-driven diffusion in dynamic networks
Guimarães, A., Vieira, A. B., da Silva, A. P. C., & Ziviani, A. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2487788.2488055 · Cited by 13
A Dynamic Model for On-Line Social Networks
Bonato, A., Hadi, N., Horn, P., Prałat, P., & Wang, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-540-95995-3_11 · Cited by 14
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
