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 901–1,000 of 1,000
Link prediction based on generalized cluster information
Kim, J., Choy, M., Kim, D., & Kang, U. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2567948.2578807 · Cited by 14
Immunization of complex networks using stochastic hill-climbing algorithm
Shams, B., & Khansari, M. (2013) · International Conference on Computer and Knowledge Engineering · doi:10.1109/iccke.2013.6682858 · Cited by 14
Models for the Compressible Web
Chierichetti, F., Kum, R., Lattanzi, S., Panconesi, A., & Raghavan, P. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.63 · Cited by 14
Assessing the effectiveness of real-world network simplification
Blagus, N., Šubelj, L., & Bajec, M. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.06.065 · Cited by 14
Lin, Y., Candan, K. S., Sundaram, H., & Xie, L. (2011) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/2037676.2037686 · Cited by 14
An Efficient Generator for Clustered Dynamic Random Networks
Görke, R., Kluge, R., Schumm, A., Staudt, C., & Wagner, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34862-4_16 · Cited by 14
Topic Modeling of Document Metadata for Visualizing Collaborations over Time
Chen, F., Chiu, P., & Lim, S. (2016) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/2856767.2856787 · Cited by 14
Ahmad, M. A. (2016) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/2851581.2892591 · Cited by 14
Network Growth and Link Prediction Through an Empirical Lens
Liu, Q., Tang, S., Zhang, X., Zhao, X., Zhao, B. Y., & Zheng, H.-T. (2016) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2987443.2987452 · Cited by 14
The structure of communities in scale‐free networks
Jiang, J., Wen, S., Yu, S., Xiang, Y., Zhou, W., & Hassan, H. (2016) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4040 · Cited by 14
A Comparison of Parallel Graph Processing Implementations
Pollard, S. D., & Norris, B. (2017) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2017.56 · Cited by 14
A Constrained Maximum Likelihood Estimator for Unguided Social Sensing
Shao, H., Yao, S., Zhao, Y., Zhang, C., Han, J., Kaplan, L., Su, L., & Abdelzaher, T. (2018) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2018.8486306 · Cited by 14
Reducing large graphs to small supergraphs: a unified approach
Liu, Y., Safavi, T., Shah, N., & Koutra, D. (2018) · Social Network Analysis and Mining · doi:10.1007/s13278-018-0491-4 · Cited by 14
On the Properties of Gromov Matrices and Their Applications in Network Inference
Ji, F. Q., Tang, W., & Tay, W. P. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2908133 · Cited by 14
Kent, C., Rechavi, A., & Rafaeli, S. (2019) · Springer eBooks · doi:10.1007/978-3-030-14610-8_9 · Cited by 14
ProtNN: fast and accurate protein 3D-structure classification in structural and topological space
Dhifli, W., & Diallo, A. B. (2016) · BioData Mining · doi:10.1186/s13040-016-0108-2 · Cited by 14
Analysis of tag within online social networks
Wu, C., & Zhou, B. (2009) · International ACM SIGGROUP Conference on Supporting Group Work (GROUP) · doi:10.1145/1531674.1531678 · Cited by 14
Stratification driven placement of complex data: A framework for distributed data analytics
Wang, Y., Parthasarathy, S., & Sadayappan, P. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544868 · Cited by 14
Discovering rare categories from graph streams
Zhou, D., Karthikeyan, A. K., Wang, K., Cao, N., & He, J. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0478-6 · Cited by 14
Impact of snowball sampling ratios on network characteristics estimation: A case study of Cyworld
곽해운, 한승엽, Ahn, Y., 문수복, & 정하웅 (2006) · 한국정보과학회 학술발표논문집 · Cited by 14
Duraisamy, K., Dempsey, K., Ali, H., & Bhowmick, S. (2011) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcsim.2011.5999898 · Cited by 13
A Novel Temporal Network-Embedding Algorithm for Link Prediction in Dynamic Networks
Abbas, K., Abbasi, A., Dong, S., Ling, N., Chen, L., & Chen, B. (2023) · Entropy · doi:10.3390/e25020257 · Cited by 13
Abbood, A. D., Attea, B. A., Hasan, A. A., Everson, R., & Pizzuti, C. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10383-2 · Cited by 13
Complementary influence maximization under comparative linear threshold model
Yang, W., Shi, Q., Yan, J., Wang, C., Song, M., & Wu, M. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121826 · Cited by 13
Notice of Removal: A Measurement Framework for Directed Networks
Salehi, M., & Rabiee, H. R. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130603 · Cited by 13
Approximate Homogeneous Graph Summarization
Liu, Z., Yu, J. X., & Cheng, H. (2012) · Journal of Information Processing · doi:10.2197/ipsjjip.20.77 · Cited by 13
Zhu, S., Soh, Y. C., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2489606 · Cited by 13
The Role of Diverse Strategies in Sustainable Knowledge Production
Wu, L., Baggio, J. A., & Janssen, M. A. (2016) · PLoS ONE · doi:10.1371/journal.pone.0149151 · Cited by 13
A Study on the Representation of the Various Models for Dynamic Social Networks
Mitra, A., Paul, S., Panda, S., & Padhi, P. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.03.079 · Cited by 13
Synthetic Social Media Data Generation
Sagduyu, Y. E., Grushin, A., & Shi, Y. (2018) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2018.2854668 · Cited by 13
Community based influence maximization in the Independent Cascade Model
Hajdú, L., Bóta, A., & Krész, M. (2018) · Annals of Computer Science and Information Systems · doi:10.15439/2018f201 · Cited by 13
Community Detection Using Maximizing Modularity and Similarity Measures in Social Networks
Chaudhary, L., & Singh, B. (2019) · Smart innovation, systems and technologies · doi:10.1007/978-981-13-8406-6_20 · Cited by 13
A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores
Gabert, K., Pınar, A., & Çatalyürek, Ü. V. (2021) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3437963.3441790 · Cited by 13
Mapping flows on weighted and directed networks with incomplete observations
Smiljanić, J., Blöcker, C., Edler, D., & Rosvall, M. (2021) · Journal of Complex Networks · doi:10.1093/comnet/cnab044 · Cited by 13
Search in Combined Social and Wireless Communication Networks: Delay and Success Analysis
Sagduyu, Y. E., Shi, Y., & Neema, K. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2430857 · Cited by 13
Modular RADAR: An Immune System Inspired Search and Response Strategy for Distributed Systems
Banerjee, S., & Moses, M. E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14547-6_10 · Cited by 13
Effective co-betweenness centrality computation
Chehreghani, M. H. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556263 · Cited by 13
Noise-tolerance community detection and evolution in dynamic social networks
Wang, L., Wang, J., Bi, Y., Wu, W., Xu, W., & Lian, B. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9719-z · Cited by 13
An Empirical Study of a Chinese Online Social Network--Renren
Niu, J., Peng, J., Shu, L., Tong, C., & Liao, W. (2013) · Computer · doi:10.1109/mc.2013.1 · Cited by 13
Evolution of developer collaboration on the jazz platform
Datta, S., Sindhgatta, R., & Sengupta, B. (2011) · India Software Engineering Conference · doi:10.1145/1953355.1953359 · Cited by 13
Multi-Aspect + Transitivity + Bias: An Integral Trust Inference Model
Yao, Y., Tong, H., Yan, X., Xu, F., & Lü, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.147 · Cited by 13
Community Discovery: Simple and Scalable Approaches
Ruan, Y., Fuhry, D., Liang, J., Wang, Y., & Parthasarathy, S. (2015) · Human-computer interaction series · doi:10.1007/978-3-319-23835-7_2 · Cited by 13
Spitz, A., & Gertz, M. (2015) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2808797.2809380 · Cited by 13
Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs
Li, L., Tong, H., Xiao, Y., & Fan, W. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.32 · Cited by 13
Models and Algorithms for Graph Watermarking
Eppstein, D., Goodrich, M. T., Lam, J., Mamano, N., Mitzenmacher, M., & Torres, M. R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45871-7_18 · Cited by 13
Detecting community structure in complex networks using an interaction optimization process
Kim, P., & Kim, S. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.08.012 · Cited by 13
Subnormal Distribution Derived From Evolving Networks With Variable Elements
Feng, M., Qu, H., Zhang, Y., & Kurths, J. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2751073 · Cited by 13
Dynamic Clustering Algorithms via Small-Variance Analysis of Markov Chain Mixture Models
Campbell, T., Kulis, B., & How, J. P. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2833467 · Cited by 13
Realizing Memory-Optimized Distributed Graph Processing
Liakos, P., Papakonstantinopoulou, K., & Delis, A. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2779797 · Cited by 13
The iterated local model for social networks
Bonato, A., Chuangpishit, H., English, S., Kay, B., & Meger, E. K. M. (2020) · Discrete Applied Mathematics · doi:10.1016/j.dam.2020.04.018 · Cited by 13
New Phenomena in Large-Scale Internet Traffic
Kepner, J., Cho, K., claffy, K., Gadepally, V. N., McGuire, S., Milechin, L., Arcand, W., Bestor, D., Bergeron, W., Byun, C., et al. (2022) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003033707-13 · Cited by 16
Systematic Dynamic and Heterogeneous Analysis of Rich Social Network Data
Meng, L., Milenković, T., & Striegel, A. (2014) · Studies in computational intelligence · doi:10.1007/978-3-319-05401-8_3 · Cited by 13
Online spam-blog detection through blog search
Zhu, L., Sun, A., & Choi, B. K. K. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458272 · Cited by 13
A Minimum Resource Neural Network Framework for Solving Multiconstraint Shortest Path Problems
Zhang, J., Zhao, X., & He, X. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2293775 · Cited by 13
Solving the missing node problem using structure and attribute information
Sina, S., Rosenfeld, A., & Kraus, S. (2013) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2492517.2492534 · Cited by 13
An Ensemble Approach for Clustering Scale›Free Graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2006) · Cited by 13
Cooke, R. J. E. (2006) · Open University of Cape Town (University of Cape Town) · Cited by 13
Benefits of Bias: Towards Better Characterization of Network SamplingPreprint
Maiya, A. S., & Berger-Wolf, T. Y. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.3911 · Cited by 13
Boosting GNN-Based Link Prediction via PU-AUC Optimization
Mao, Y., Yu, H., Cao, X., Gao, Y., Yao, C., & Lin, X. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3525490 · Cited by 12
The Geometric Protean Model for On-Line Social Networks
Bonato, A., Janssen, J., & Prałat, P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-18009-5_11 · Cited by 12
Shielding Graph for eXact Analytics With SGX
Du, M., Jiang, P., Wang, Q., Chow, S. S. M., & Zhao, L. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3241164 · Cited by 12
Fu, K., Chen, Q., Yang, Y., Shi, J., Li, C., & Guo, M. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607040 · Cited by 12
Hypergraph motifs and their extensions beyond binary
Lee, G., Yoon, S., Ko, J., Kim, H., & Shin, K. (2023) · The VLDB Journal · doi:10.1007/s00778-023-00827-8 · Cited by 12
The Structure Entropy of Social Networks
Li, Z., Yan, Z., Yang, J. J., & Tang, X. (2024) · Journal of Systems Science and Complexity · doi:10.1007/s11424-024-2484-x · Cited by 12
On Modelling Social Propagation Phenomenon
Król, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-05458-2_24 · Cited by 12
Analyzing Communication Interaction Networks (CINs) in enterprises and inferring hierarchies
Wang, Y., Iliofotou, M., Faloutsos, M., & Wu, B. (2013) · Computer Networks · doi:10.1016/j.comnet.2012.11.028 · Cited by 12
Product Adoption Networks and Their Growth in a Large Mobile Phone Network
Sundsøy, P., Bjelland, J., Canright, G., Engø‐Monsen, K., & Ling, R. (2010) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2010.38 · Cited by 12
Probabilistic Inductive Classes of Graphs
Kejžar, N., NIKOLOSKI, Z., & BATAGELJ, V. (2008) · Journal of Mathematical Sociology · doi:10.1080/00222500801931586 · Cited by 12
Homophyly/Kinship Model: Naturally Evolving Networks
Li, A., Li, J., Pan, Y., Yin, X., & Yong, X. (2015) · Scientific Reports · doi:10.1038/srep15140 · Cited by 12
Growing Graphs from Hyperedge Replacement Graph Grammars
Aguiñaga, S., Palacios, R., Chiang, D., & Weninger, T. (2016) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2983323.2983826 · Cited by 12
Relay-Linking Models for Prominence and Obsolescence in Evolving Networks
Singh, M. P., Sarkar, R., Goyal, P., Mukherjee, A., & Chakrabarti, S. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098146 · Cited by 12
Exploring the evolution of node neighborhoods in Dynamic Networks
Orman, G. K., Labatut, V., & Naskalı, A. T. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.04.084 · Cited by 11
Semi-supervised link prediction based on non-negative matrix factorization for temporal networks
Zhang, T., Zhang, K., Li, X., Lv, L., & Sun, Q. (2021) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2021.110769 · Cited by 12
Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis
Fan, Z., Mao, C., Wu, Y., & Xu, J. (2022) · Foundations of Computational Mathematics · doi:10.1007/s10208-022-09570-y · Cited by 12
ECODE: Event-Based Community Detection from Social Networks
Li, X., Tan, A., Yu, P. S., & Ng, S.-K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20149-3_4 · Cited by 12
Patterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG Model
Koutra, D., Koutras, V. M., Prakash, B. A., & Faloutsos, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37453-1_17 · Cited by 12
Self-citationSpeedup for a periodic subgraph miner
Alberto Apostolico, A., Barbares, M., & Pizzi, C. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.02.016 · Cited by 12
Community Evolution in Dynamic Social Networks -- Challenges and Problems
Takaffoli, M. (2011) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2011.52 · Cited by 12
Evolution of scientific collaboration networks
Madaan, G., & Jolad, S. (2014) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2014.7004346 · Cited by 12
The Evolution of Friendships in Chinese Online Social Networks
Yu, L. L., & King, V. (2010) · doi:10.1109/socialcom.2010.21 · Cited by 12
The role of research leaders on the evolution of scientific communities
Alves, B. L., Benevenuto, F., & Laender, A. H. F. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2487788.2488016 · Cited by 12
Evolving models for meso-scale structures
Saxena, A., & Iyengar, S. R. S. (2016) · doi:10.1109/comsnets.2016.7439976 · Cited by 12
On the Behaviour of Deviant Communities in Online Social Networks
Coletto, M., Aiello, L. M., Lucchese, C., & Silvestri, F. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v10i1.14726 · Cited by 13
Disk-based shortest path discovery using distance index over large dynamic graphs
Hong, J., Park, K., Han, Y., Rasel, M. K., Vonvou, D., & Lee, Y.-K. (2016) · Information Sciences · doi:10.1016/j.ins.2016.12.013 · Cited by 12
He, X., & Liu, Y. (2017) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3018661.3018675 · Cited by 12
Graph-Structured Sparse Optimization for Connected Subgraph Detection
Zhou, B., & Chen, F. (2016) · Proceedings · doi:10.1109/icdm.2016.0082 · Cited by 12
Network assembly of scientific communities of varying size and specificity
Citron, D. T., & Way, S. F. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2017.12.008 · Cited by 12
Directed closure coefficient and its patterns
Jia, M., Gabryś, B., & Musiał, K. (2021) · PLoS ONE · doi:10.1371/journal.pone.0253822 · Cited by 12
How Online Social Network Affects Offline Events: A Case Study on Douban
Han, J., Niu, J., Chin, A., Wang, W., Tong, C., & Wang, X. (2012) · Autonomic and Trusted Computing · doi:10.1109/uic-atc.2012.149 · Cited by 12
A message passing benchmark for unbalanced applications
Dinan, J., Olivier, S. L., Sabin, G., Prins, J. F., Sadayappan, P., & Tseng, C. (2008) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2008.06.004 · Cited by 12
Bóta, A., Krész, M., & Pluhár, A. (2014) · Annals of Computer Science and Information Systems · doi:10.15439/2014f261 · Cited by 12
Prediction of Virality Timing Using Cascades in Social Media
Cheung, M., She, J. P. M., Junus, A., & Cao, L. (2016) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/2978771 · Cited by 13
Algorithms for Analyzing and Mining Real-World Graphs
Takes, F. W. (2014) · Leiden Repository (Leiden University) · Cited by 12
Distances and Isomorphism between Networks and the Stability of Network InvariantsPreprint
Chowdhury, S., & Mémoli, F. (2017) · arXiv (Cornell University) · Cited by 12
BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks
Jung, J., Park, H.-M., & Kang, U. (2020) · Movebank · doi:10.5441/002/edbt.2020.18 · Cited by 12
Accurate, efficient and scalable training of Graph Neural Networks
Zeng, H., Zhou, H., Srivastava, A., Kannan, R., & Prasanna, V. K. (2020) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2020.08.011 · Cited by 11
Learning deep representation and discriminative features for clustering of multi-layer networks
Wu, W., Ma, X., Wang, Q., Gong, M., & Gao, Q. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.11.053 · Cited by 11
Sampling hypergraphs via joint unbiased random walk
Luo, Q., Xie, Z., Liu, Y., Yu, D., Cheng, X., Lin, X., & Jia, X. (2024) · World Wide Web · doi:10.1007/s11280-024-01253-8 · Cited by 11
MECIM: Multi-entity evolutionary competitive influence maximization in social networks
Liang, Z., Liu, J., Du, H., & Zhang, C. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.126436 · Cited by 11
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
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