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 301–400 of 1,000
Multi-scale dynamics in a massive online social network
Zhao, X., Sala, A., Wilson, C., Wang, X., Gaito, S., Zheng, H.-T., & Zhao, B. Y. (2012) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2398776.2398795 · Cited by 64
Can WhatsApp Counter Misinformation by Limiting Message Forwarding?
Melo, P. D. F., Vieira, C. C., Garimella, K., de Melo, P. O. S. V., & Benevenuto, F. (2019) · Studies in computational intelligence · doi:10.1007/978-3-030-36687-2_31 · Cited by 67
The G* graph database: efficiently managing large distributed dynamic graphs
Labouseur, A. G., Birnbaum, J., Olsen, P. W., Spillane, S. R., Vijayan, J., Hwang, J.-H., & Han, W.-S. (2014) · Distributed and Parallel Databases · doi:10.1007/s10619-014-7140-3 · Cited by 63
Constructing and sampling graphs with a prescribed joint degree distribution
Stanton, I., & Pınar, A. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2330086 · Cited by 63
Machine Learning in Network Centrality Measures
Grando, F., Granville, L. Z., & Lamb, L. C. (2018) · ACM Computing Surveys · doi:10.1145/3237192 · Cited by 71
Miao, Y., Han, W., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, E., & Chen, W. (2015) · ACM Transactions on Storage · doi:10.1145/2700302 · Cited by 63
Searching for Rising Stars in Bibliography Networks
Li, X., Foo, C.-S., Tew, K. L., & Ng, S.-K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00887-0_25 · Cited by 62
Network Under Joint Node and Link Attacks: Vulnerability Assessment Methods and Analysis
Dinh, T. N., & Thai, M. T. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317486 · Cited by 62
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes
Chester, S., Kapron, B. M., Ramesh, G., Srivastava, G., Thomo, A., & Venkatesh, S. (2012) · Social Network Analysis and Mining · doi:10.1007/s13278-012-0084-6 · Cited by 63
Kang, U., & Faloutsos, C. (2013) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2481244.2481249 · Cited by 61
Self-citationIs Wikipedia link structure different?
Kamps, J., & Koolen, M. (2009) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1498759.1498831 · Cited by 61
Subgraph detection using eigenvector L1 norms
Miller, B. A., Bliss, N. T., & Wolfe, P. J. (2010) · Cited by 61
Mining graph patterns efficiently via randomized summaries
Chen, C., Lin, C. X., Fredrikson, M., Christodorescu, M., Yan, X., & Han, J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687711 · Cited by 61
Evaluation of Graph Sampling: A Visualization Perspective
Wu, Y., Cao, N., Archambault, D., Shen, Q., Qu, H., & Cui, W. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2598867 · Cited by 61
Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware ModelsPreprint
Galhotra, S., Arora, A., & Roy, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.03110 · Cited by 61
Reinforced Causal Explainer for Graph Neural Networks
Wang, X., Wu, Y., Zhang, A., Feng, F., He, X., & Chua, T. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3170302 · Cited by 67
Time-based sampling of social network activity graphs
Ahmed, N. K., Berchmans, F. J., Neville, J., & Kompella, R. R. (2010) · Mining and Learning with Graphs · doi:10.1145/1830252.1830253 · Cited by 60
A derandomized approximation algorithm for the critical node detection problem
Ventresca, M., & Aleman, D. M. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2013.09.012 · Cited by 60
Pattabiraman, B., Patwary, M. M. A., Gebremedhin, A. H., Liao, W., & Choudhary, A. (2015) · Internet Mathematics · doi:10.1080/15427951.2014.986778 · Cited by 58
Recommending People in Developers' Collaboration Network
Surian, D., Liu, N., Lo, D., Tong, H., Lim, E., & Faloutsos, C. (2011) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.2011.53 · Cited by 59
Self-citationTorkjazi, M., Rejaie, R., & Willinger, W. (2009) · doi:10.1145/1592665.1592676 · Cited by 59
Yao, Y., Tong, H., Yan, X., Xu, F., & Lü, J. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488516 · Cited by 59
Frequent subgraph discovery in dynamic networks
Wackersreuther, B., Wackersreuther, P., Oswald, A., Böhm, C., & Borgwardt, K. M. (2010) · Mining and Learning with Graphs · doi:10.1145/1830252.1830272 · Cited by 59
Emerging approaches in literature-based discovery: techniques and performance review
Sebastian, Y., Siew, E.-G., & Orimaye, S. O. (2017) · The Knowledge Engineering Review · doi:10.1017/s0269888917000042 · Cited by 59
Active and Semi-Supervised Graph Neural Networks for Graph Classification
Xie, Y., Lv, S., Qian, Y., Wen, C., & Liang, J. (2022) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2021.3140205 · Cited by 58
Evolutionary Clustering and Analysis of Bibliographic Networks
Gupta, M., Aggarwal, C. C., Han, J., & Sun, Y. (2011) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2011.12 · Cited by 58
Complex Network Measurements: Estimating the Relevance of Observed Properties
Matthieu Latapy, B., & Magnien, C. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.227 · Cited by 58
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
Jamour, F., Skiadopoulos, S., & Kalnis, P. (2017) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2017.2763951 · Cited by 58
Bonifati, A., Holubová, I., Prat-Pèrez, A., & Sakr, S. (2020) · ACM Computing Surveys · doi:10.1145/3379445 · Cited by 58
Computing Classic Closeness Centrality, at ScalePreprint
Cohen, E., Delling, D., Pajor, T., & Werneck, R. F. (2014) · Cited by 58
Feng, G., Ma, Z., Li, D., Chen, S., Zhu, X., Han, W., & Chen, W. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3457263 · Cited by 57
Sampling algorithms for pure network topologies
Airoldi, E. M., & Carley, K. M. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117457 · Cited by 57
Tracking changes in dynamic information networks
Takaffoli, M., Fagnan, J., Sangi, F., & Zai͏̈ane, O. R. (2011) · International Conference on Computational Aspects of Social Networks (CASoN) · doi:10.1109/cason.2011.6085925 · Cited by 58
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
Akoglu, L., McGlohon, M., & Faloutsos, C. (2008) · Proceedings · doi:10.1109/icdm.2008.123 · Cited by 57
Self-citationNetwork dynamics of Chinese university knowledge transfer
Ye, Y., Moortel, K. D., & Crispeels, T. (2019) · The Journal of Technology Transfer · doi:10.1007/s10961-019-09748-7 · Cited by 57
Less is More: Sparse Graph Mining with Compact Matrix Decomposition
Sun, J., Xie, Y., Zhang, H., & Faloutsos, C. (2007) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.102 · Cited by 57
Self-citationBrief encounters: Sensing, modeling and visualizing urban mobility and copresence networksPreprint
Kostakos, V., O'Neill, E. J., Penn, A., Roussos, G., & Papadongonas, D. (2010) · arXiv (Cornell University) · Cited by 57
Transfer Learning of Graph Neural Networks with Ego-graph Information MaximizationPreprint
Zhu, Q., Yang, C., Xu, Y., Wang, H., Zhang, C., & Han, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.05204 · Cited by 60
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
Kang, U., Tsourakakis, C. E., Appel, A. P., Faloutsos, C., & Leskovec, J. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.48 · Cited by 56
Self-citationLSMD: A fast and robust local community detection starting from low degree nodes in social networks
Bouyer, A., & Roghani, H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.07.011 · Cited by 56
Community evolution prediction in dynamic social networks
Takaffoli, M., Reihaneh Rabbany, K., & Zai͏̈ane, O. R. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921553 · Cited by 56
Best influential spreaders identification using network global structural properties
Namtirtha, A., Dutta, A., Dutta, B., Sundararajan, A., & Simmhan, Y. L. (2021) · Scientific Reports · doi:10.1038/s41598-021-81614-9 · Cited by 59
Efficient Topological OLAP on Information Networks
Qu, Q., Zhu, F., Yan, X., Han, J., Yu, P. S., & Li, H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20149-3_29 · Cited by 55
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
Folino, F., & Pizzuti, C. (2010) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2010.23 · Cited by 56
Motif Counting Beyond Five Nodes
Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., & Panconesi, A. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3186586 · Cited by 55
Predicting Links and Inferring Attributes using a Social-Attribute Network (SAN)Preprint
Gong, N. Z., Talwalkar, A., Mackey, L. W., Huang, L., Shin, E. C. R., Shin, R., & Stefanov, E. (2011) · arXiv (Cornell University) · Cited by 54
Chi, Y., Tseng, B. L., & Tatemura, J. (2006) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1183614.1183628 · Cited by 55
Swarm Intelligence Techniques in Recommender Systems-a Review of Recent Research
Peška, L., Tashu, T. M., & Horváth, T. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.003 · Cited by 54
Iwendi, C., Ponnan, S., Munirathinam, R., Srinivasan, K., & Chang, C. (2019) · Electronics · doi:10.3390/electronics8111331 · Cited by 54
Dynamic Graph Representation Learning With Neural Networks: A Survey
Yang, L., Chatelain, C., & Adam, S. (2024) · IEEE Access · doi:10.1109/access.2024.3378111 · Cited by 71
Generating Attributed Networks with Communities
Largeron, C., Mougel, P.-N., Reihaneh Rabbany, K., & Zai͏̈ane, O. R. (2015) · PLoS ONE · doi:10.1371/journal.pone.0122777 · Cited by 54
Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs
Whitbeck, J., Conan, V., & de Amorim, M. D. (2011) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.020811.090163 · Cited by 54
$\text{RD}\small{\text{YN}}$ : graph benchmark handling community dynamics
Rossetti, G. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx016 · Cited by 54
Mean estimation with sub-Gaussian rates in polynomial time
Hopkins, S. B. (2020) · The Annals of Statistics · doi:10.1214/19-aos1843 · Cited by 73
Aghaalizadeh, S., Afshord, S. T., Bouyer, A., & Anari, B. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.125420 · Cited by 53
Jia, A. L., Shen, S., van de Bovenkamp, R., Iosup, A., Kuipers, F. A., & Epema, D. H. J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2736698 · Cited by 53
Davitz, J., Yu, J., Basu, S., Gutelius, D., & Harris, A. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281292 · Cited by 52
Henderson, K. A., Eliassi‐Rad, T., Faloutsos, C., Akoglu, L., Li, L., Maruhashi, K., Prakash, B. A., & Tong, H. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835828 · Cited by 53
Self-citationLink direction for link prediction
Shang, K.-K., SMALL, M. P., & Yan, W.-S. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.11.129 · Cited by 53
Modeling and Predicting Community Structure Changes in Time-Evolving Social Networks
Tajeuna, E. G., Bouguessa, M., & Wang, S. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2851586 · Cited by 54
Signed Network Modeling Based on Structural Balance Theory
Derr, T., Aggarwal, C. C., & Tang, J. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271746 · Cited by 53
Identifying influential nodes in weighted complex networks using an improved WVoteRank approach
Kumar, S., & Panda, A. (2021) · Applied Intelligence · doi:10.1007/s10489-021-02403-5 · Cited by 53
A Spectral Framework for Anomalous Subgraph Detection
Miller, B. A., Beard, M. S., Wolfe, P. J., & Bliss, N. T. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2437841 · Cited by 53
The Effect of Collective Attention on Controversial Debates on Social Media
Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2017) · Proceedings of the 2017 ACM on Web Science Conference · doi:10.1145/3091478.3091486 · Cited by 56
“Several studies have looked at how networks evolve, and proposed models of network formation [20, 21].”
BackgroundInfluentialFeng, Z., Wang, R., Wang, T., Song, M., Wu, S., & He, S. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3621291 · Cited by 98
Model Selection for Social Networks Using Graphlets
Janssen, J., Hurshman, M., & Kalyaniwalla, N. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.671149 · Cited by 52
Synergistic Analysis of Evolving Graphs
Vora, K., Gupta, R., & Xu, G. H. (2016) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2992784 · Cited by 52
Localized eigenvectors of the non-backtracking matrix
Kawamoto, T. (2016) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2016/02/023404 · Cited by 51
Hartmann, T., Kappes, A., & Wagner, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49487-6_9 · Cited by 51
Kutzkov, K., Bifet, A., Bonchi, F., & Gionis, A. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487657 · Cited by 51
Efficient ad-hoc search for personalized PageRank
Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., & Onizuka, M. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2463717 · Cited by 51
Community detection in dynamic social networks: A game-theoretic approach
Alvari, H., Hajibagheri, A., & Sukthankar, G. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921567 · Cited by 51
Modeling the clustering in citation networks
Ren, F., Shen, H., & Cheng, X. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.02.001 · Cited by 50
Gonzalez, R., Cuevas, R., Motamedi, R., Rejaie, R., & Cuevas, √. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488431 · Cited by 50
Diffusion of “Following” Links in Microblogging Networks
Zhang, J., Fang, Z., Chen, W., & Tang, J. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2407351 · Cited by 50
Incremental Subgraph Feature Selection for Graph Classification
Wang, H., Zhang, P., Xingquan Zhu, A., Tsang, I. W.-H., Chen, L., Zhang, C., & Wu, X. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2616305 · Cited by 50
Topîrceanu, A., Udrescu, M., & Mărculescu, R. (2018) · Scientific Reports · doi:10.1038/s41598-018-29224-w · Cited by 50
Discovering correlated spatio-temporal changes in evolving graphs
Chan, J., Bailey, J., & Leckie, C. A. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0117-z · Cited by 50
Topological Properties and Temporal Dynamics of Place Networks in Urban Environments
Noulas, A., Shaw, B., Lambiotte, R., & Mascolo, C. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2740908.2745402 · Cited by 51
Constraint-Based Pattern Mining in Dynamic Graphs
Robardet, C. (2009) · Proceedings · doi:10.1109/icdm.2009.99 · Cited by 49
Smart, J. M. (2011) · Acta Astronautica · doi:10.1016/j.actaastro.2011.11.006 · Cited by 58
Incremental Maintenance of 2-Hop Labeling of Large Graphs
Bramandia, R., Choi, B. K. K., & Ng, W. K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.117 · Cited by 49
Scholarly interest in gamification: a citation network analysis
Harman, K. A., Koohang, A. A., & Paliszkiewicz, J. O. (2014) · Industrial Management & Data Systems · doi:10.1108/imds-07-2014-0208 · Cited by 50
Networks in Agent-Based Social Simulation
Alam, S. J., & Geller, A. (2011) · Springer eBooks · doi:10.1007/978-90-481-8927-4_11 · Cited by 50
Graph contrastive learning with implicit augmentations
Liang, H., Du, X., Zhu, B., Ma, Z., Chen, K., & Gao, J. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.04.001 · Cited by 51
RTG: A Recursive Realistic Graph Generator Using Random Typing
Akoglu, L., & Faloutsos, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04180-8_13 · Cited by 48
Self-citationLink Prediction on Evolving Data Using Tensor Factorization
Spiegel, S., Clausen, J. H., Albayrak, Ş., & Kunegis, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28320-8_9 · Cited by 48
The clustering coefficient of a scale-free random graph
Eggemann, N., & Noble, S. D. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.02.003 · Cited by 48
Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
Fegley, B. D., & Torvik, V. I. (2013) · PLoS ONE · doi:10.1371/journal.pone.0070299 · Cited by 48
DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks
Wehmuth, K., & Ziviani, A. (2013) · Computer Networks · doi:10.1016/j.comnet.2013.05.001 · Cited by 48
Framework of Evolutionary Algorithm for Investigation of Influential Nodes in Complex Networks
Liu, Y., Wang, X., & Kurths, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2901012 · Cited by 48
Complex Network Analysis of the Bitcoin Transaction Network
Tao, B., Dai, H., Wu, J., Ho, I. W., Zheng, Z., & Cheang, C. F. (2021) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2021.3127952 · Cited by 57
Pre-training Graph Neural Network for Cross Domain Recommendation
Wang, C., Liang, Y., Liu, Z., Zhang, T., & Yu, P. S. (2021) · IEEE International Conference on Cognitive Machine Intelligence (CogMI) · doi:10.1109/cogmi52975.2021.00026 · Cited by 52
Scalable Link Prediction on Multidimensional Networks
Rossetti, G., Berlingerio, M., & Giannotti, F. (2011) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2011.150 · Cited by 47
Mining knowledge from databases
Han, J., Sun, Y., Yan, X., & Yu, P. S. (2010) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1807167.1807333 · Cited by 47
Influence maximization of informed agents in social networks
Askarisichani, O., & Jalili, M. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2014.12.139 · Cited by 48
How is the Semantic Web evolving? A dynamic social network perspective
Zhou, L., Ding, L., & Finin, T. (2010) · Computers in Human Behavior · doi:10.1016/j.chb.2010.07.024 · Cited by 47
Detecting artificial behaviours in the Bitcoin users graph
Maesa, D. D. F., Marino, A., & Ricci, L. (2017) · Online Social Networks and Media · doi:10.1016/j.osnem.2017.10.006 · Cited by 47
Efficient Mining of Frequent Patterns on Uncertain Graphs
Chen, Y., Zhao, X. H., Lin, X., Wang, Y., & Guo, D. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2830336 · Cited by 47
Characterizing Online Public Discussions through Patterns of Participant Interactions
Zhang, J., Danescu-Niculescu-Mizil, C., Sauper, C., & Taylor, S. J. (2018) · Proceedings of the ACM on Human-Computer Interaction · doi:10.1145/3274467 · Cited by 48
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
