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 601–700 of 1,000
Matched filtering for subgraph detection in dynamic networks
Miller, B. A., Beard, M. S., & Bliss, N. T. (2011) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2011.5967745 · Cited by 26
Automatic algorithm transformation for efficient multi-snapshot analytics on temporal graphs
Then, M., Kersten, T., Günnemann, S., Kemper, A., & Neumann, T. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3090163.3090166 · Cited by 26
Ruocco, G., Daraio, C. C., Folli, V., & Leonetti, M. (2017) · Humanities and Social Sciences Communications · doi:10.1057/palcomms.2017.64 · Cited by 27
Action-based Modeling of Complex Networks
Arora, V., & Ventresca, M. (2017) · Scientific Reports · doi:10.1038/s41598-017-05444-4 · Cited by 25
Tracking Network Evolution and Their Applications in Structural Network Analysis
Wu, T.-H., Chang, C., & Liao, W. (2018) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2018.2815686 · Cited by 27
Khan, A., Yuan, Y., & Chen, L. (2018) · Synthesis lectures on data management · doi:10.1007/978-3-031-01860-2 · Cited by 26
Validity Issues In The Use Of Social Network Analysis For The Study Of Online Communities
Howison, J., Crowston, K., & Wiggins, A. (2011) · doi:10.5281/zenodo.913302 · Cited by 26
Power Grid Network Evolutions for Local Energy TradingPreprint
Pagani, G. A., & Aiello, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1201.0962 · Cited by 26
A place-focused model for social networks in cities
Brown, C., Noulas, A., Cecilia Mascolo, C., Blondel, V. D., et al. (n.d.) · Cambridge University Engineering Department Publications Database · Cited by 26
Yang, W., Luo, J., & Wu, J. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2021.3102683 · Cited by 25
Towards Inductive and Efficient Explanations for Graph Neural Networks
Luo, D., Zhao, T., Cheng, W. D., Xu, D., Han, F., Yu, W., Liu, X., Chen, H., & Zhang, X. D. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3362584 · Cited by 26
Randomized Spectral Clustering in Large-Scale Stochastic Block Models
Zhang, H., Guo, X., & Chang, X. (2022) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2022.2034636 · Cited by 25
Rapid Detection of Local Communities in Graph Streams
Liakos, P., Papakonstantinopoulou, K., Ntoulas, A., & Delis, A. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3012608 · Cited by 25
SocialCDN: Caching techniques for distributed social networks
Han, L., Punceva, M., Nath, B., Muthukrishnan, S., & Iftode, L. (2012) · IEEE International Conference on Peer-to-Peer Computing (P2P) · doi:10.1109/p2p.2012.6335799 · Cited by 25
Qiao, S., & Ozsoyoglu, Z. M. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2746479 · Cited by 25
Practical collapsed variational bayes inference for hierarchical dirichlet process
Sato, I., Kurihara, K., & Nakagawa, H. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339550 · Cited by 25
Generating random graphs with tunable clustering coefficients
Heath, L. S., & Parikh, N. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.06.052 · Cited by 25
Overcoming Relational Learning Biases to Accurately Predict Preferences in Large Scale Networks
Pfeiffer, J. J., Neville, J., & Bennett, P. N. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741668 · Cited by 25
Social network sampling using spanning trees
Jalali, Z. S., Rezvanian, A., & Meybodi, M. R. (2015) · International Journal of Modern Physics C · doi:10.1142/s0129183116500522 · Cited by 25
Survivability in Time-Varying Networks
Liang, Q., & Modiano, E. (2016) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2016.2636152 · Cited by 25
Querying massive graph data: A compress and search approach
Nabti, C., & Seba, H. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.04.005 · Cited by 25
Structure and Evolution of Online Social Networks
Ghosh, S., & Ganguly, N. (2014) · Intelligent systems reference library · doi:10.1007/978-3-319-05164-2_2 · Cited by 25
Kent, C., & Rechavi, A. (2018) · International Journal of Research & Method in Education · doi:10.1080/1743727x.2018.1524867 · Cited by 25
Transduction on Directed Graphs via Absorbing Random Walks
De, J., Zhang, X., Lin, F., & Cheng, L. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2730871 · Cited by 32
Modeling Social Networks through User Background and Behavior
Foudalis, I., Jain, K. K., Papadimitriou, C. H., & Sideri, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21286-4_8 · Cited by 24
On the growth of Internet application flows: A complex network perspective
Wu, X., Yu, K., & Wang, X. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935019 · Cited by 24
A synthetic data generator for online social network graphs
Nettleton, D. (2016) · Social Network Analysis and Mining · doi:10.1007/s13278-016-0352-y · Cited by 24
Efficient target control of complex networks based on preferential matching
Zhang, X., Wang, H., & Lv, T. (2017) · PLoS ONE · doi:10.1371/journal.pone.0175375 · Cited by 24
Understanding the Structural Characteristics of Data Platforms Using Metadata and a Network Approach
Hayashi, T., & Ohsawa, Y. (2020) · IEEE Access · doi:10.1109/access.2020.2975064 · Cited by 24
Shortest-path queries on complex networks
Zhang, J., Li, W., Yuan, L., Qin, L., Zhang, Y., & Chang, L. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3551793.3551820 · Cited by 24
SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE
Soman, J., Kothapalli, K., & Narayanan, P. J. (2010) · Parallel Processing Letters · doi:10.1142/s0129626410000272 · Cited by 24
Parallel Subgraph Counting for Multicore Architectures
Aparício, D., Ribeiro, P. M. P., & da Silva, F. M. A. (2014) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2014.14 · Cited by 24
Locating the propagation source on complex networks with Propagation Centrality algorithm
Yang, F., Zhang, R., Yao, Y., & Yuan, Y. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.013 · Cited by 24
Boosting Vertex-Cut Partitioning for Streaming Graphs
Sajjad, H. P., Payberah, A. H., Rahimian, F., Vlassov, V., & Haridi, S. (2016) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2016.10 · Cited by 24
TM-Miner: TFS-Based Algorithm for Mining Temporal Motifs in Large Temporal Network
Sun, X., Tan, Y., Wu, Q., Chen, B., & Chang-xiang, S. (2019) · IEEE Access · doi:10.1109/access.2019.2911181 · Cited by 24
Learning Graph Topological Features via GAN
Liu, W., Chen, P., Yu, F., Suzumura, T., & Hu, G. (2019) · IEEE Access · doi:10.1109/access.2019.2898693 · Cited by 24
Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs
Tsitsulin, A., Munkhoeva, M., & Perozzi, B. (2020) · International World Wide Web Conference (WWW) · doi:10.1145/3366423.3380026 · Cited by 24
A survey of social network and information dissemination analysis
Fang, B., Jia, Y., Han, Y., Li, S., & Zhou, B. (2014) · Chinese Science Bulletin · doi:10.1007/s11434-014-0368-5 · Cited by 24
Models of on-line social networksPreprint
Bonato, A., Hadi, N., Horn, P., Prałat, P., & Wang, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.3388 · Cited by 21
Cracker: Crumbling large graphs into connected components
Lulli, A., Ricci, L., Carlini, E., Dazzi, P., & Lucchese, C. (2015) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2015.7405576 · Cited by 23
Community detection in dynamic networks via adaptive label propagation
Han, J., Li, W., Zhao, L., Su, Z. M., Zou, Y., & Deng, W. (2017) · PLoS ONE · doi:10.1371/journal.pone.0188655 · Cited by 23
Measurement and Analysis of the Swarm Social Network With Tens of Millions of Nodes
Chen, Y., Hu, J., Zhao, H., Xiao, Y., & Hui, P. (2018) · IEEE Access · doi:10.1109/access.2018.2789915 · Cited by 23
Do Recommender Systems Make Social Media More Susceptible to Misinformation Spreaders?
Tommasel, A., & Menczer, F. (2022) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/3523227.3551473 · Cited by 23
Random Walks on Networks with Centrality-Based Stochastic Resetting
Zelenkovski, K., Sandev, T., Metzler, R., Kocarev, L., & Basnarkov, L. (2023) · Entropy · doi:10.3390/e25020293 · Cited by 23
On the network effect in Web 2.0 applications
Aggarwal, C. C., & Yu, P. S. (2011) · Electronic Commerce Research and Applications · doi:10.1016/j.elerap.2011.11.001 · Cited by 23
Chen, H., & Giles, C. L. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2776894 · Cited by 23
Leaving us in tiers: can homophily be used to generate tiering effects?
Hirshman, B. R., Charles, J. S., & Carley, K. M. (2011) · Computational and Mathematical Organization Theory · doi:10.1007/s10588-011-9088-4 · Cited by 23
Optimizing Network Topology for Cascade Resilience
Gutfraind, A. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4614-0857-4_2 · Cited by 23
Generating realistic scaled complex networks
Staudt, C., Hamann, M., Gutfraind, A., Safro, I., & Meyerhenke, H. (2017) · Applied Network Science · doi:10.1007/s41109-017-0054-z · Cited by 25
An Improved Method for Measuring the Complexity in Complex Networks Based on Structure Entropy
Lei, M., Liu, L., & Wei, D. (2019) · IEEE Access · doi:10.1109/access.2019.2950691 · Cited by 23
Barbosa, S., Cosley, D., Sharma, A. K., & Junior, R. M. C. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872427.2883083 · Cited by 23
Analyzing knowledge communities using foreground and background clusters
Kandylas, V., Upham, S. P., & Ungar, L. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1754428.1754430 · Cited by 23
Meme ranking to maximize posts virality in microblogging platforms
Bonchi, F., Castillo, C., & Ienco, D. (2011) · Journal of Intelligent Information Systems · doi:10.1007/s10844-011-0181-4 · Cited by 23
The Atlas for the Aspiring Network ScientistPreprint
Coscia, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.00863 · Cited by 66
As Time Goes by: Discovering Eras in Evolving Social Networks
Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., & Pedreschi, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13657-3_11 · Cited by 22
Sun, Y., Wu, T., Yin, Z., Cheng, H., Han, J., Yin, X., & Zhao, P. (2008) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1376616.1376770 · Cited by 22
GUISE: a uniform sampler for constructing frequency histogram of graphlets
Rahman, M., Bhuiyan, M. A., Rahman, M., & Hasan, M. A. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-013-0673-3 · Cited by 22
Estimating robustness in large social graphs
Malliaros, F. D., Megalooikonomou, V., & Faloutsos, C. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-014-0810-7 · Cited by 22
Self-citationButcher, B., Huang, V., Robinson, C., Reffin, J., Sgaier, S. K., Charles, G., & Quadrianto, N. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.612551 · Cited by 22
Unsupervised Matching of Data and Text
Ahmadi, N., Sand, H., & Papotti, P. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00084 · Cited by 25
Evolving networks: Eras and turning points
Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., & Pedreschi, D. (2013) · Intelligent Data Analysis · doi:10.3233/ida-120566 · Cited by 22
Overlapping Community Detection in Dynamic Networks
Aston, N., Hertzler, J., & Hu, W. (2014) · Journal of Software Engineering and Applications · doi:10.4236/jsea.2014.710078 · Cited by 22
A Place-Focused Model for Social Networks in Cities
Brown, C., Noulas, A., Cecilia Mascolo, C., & Blondel, V. D. (2013) · International Conference on Social Computing · doi:10.1109/socialcom.2013.18 · Cited by 22
Analysis of dynamic resource access patterns in a blended learning course
Hecking, T., Ziebarth, S., & Hoppe, H. U. (2014) · International Conference on Learning Analytics and Knowledge (LAK) · doi:10.1145/2567574.2567584 · Cited by 22
Feature Extraction from Degree Distribution for Comparison and Analysis of Complex Networks
Aliakbary, S., Habibi, J., & Movaghar, A. (2015) · The Computer Journal · doi:10.1093/comjnl/bxv007 · Cited by 22
Network Dynamics to Evaluate Performance of an Academic Institution
Hughes, M. E., Peeler, J., & Hogenesch, J. B. (2010) · Science Translational Medicine · doi:10.1126/scitranslmed.3001580 · Cited by 22
Influence maximization based on reachability sketches in dynamic graphs
Kim, D., Hyeon, D., Oh, J., Han, W.-S., & Yu, H. (2017) · Information Sciences · doi:10.1016/j.ins.2017.02.023 · Cited by 22
DANCer: dynamic attributed networks with community structure generation
Largeron, C., Mougel, P.-N., Benyahia, O., & Zai͏̈ane, O. R. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-017-1028-2 · Cited by 22
A generalized tree augmented naive Bayes link prediction model
Wu, J. (2018) · Journal of Computational Science · doi:10.1016/j.jocs.2018.04.006 · Cited by 22
A novel ITÖ Algorithm for influence maximization in the large-scale social networks
Wang, Y., Dong, W., & Dong, X. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.04.026 · Cited by 22
Kolli, N., & Balakrishnan, N. (2019) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2019.2939841 · Cited by 24
Zheng, C. Y., Zhang, Q., Long, G., Chengqi Zhang, B., Young, S. D., & Wang, W. W. (2020) · IEEE Access · doi:10.1109/access.2020.2991683 · Cited by 23
Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs
Wang, P., Li, C., Wang, J., Wang, T., Zhang, L., Leng, J., Chen, Q., & Guo, M. (2021) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact52795.2021.00029 · Cited by 26
The accelerated growth of the worldwide air transportation network
Azzam, M., Klingauf, U., & Zock, A. (2013) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2013-01713-7 · Cited by 22
Measuring Fundamental Properties of Real-World Complex NetworksPreprint
Matthieu Latapy, B., & Magnien, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0609115 · Cited by 22
Practical methods for graph two-sample testingPreprint
Ghoshdastidar, D., & Ulrike Von Luxburg, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.12752 · Cited by 22
A Parallel Graph Sampling Algorithm for Analyzing Gene Correlation Networks
Dempsey, K., Duraisamy, K., Ali, H., & Bhowmick, S. (2011) · Procedia Computer Science · doi:10.1016/j.procs.2011.04.015 · Cited by 21
MapReduce-Based SimRank Computation and Its Application in Social Recommender System
Li, L., Li, C., Chen, H., & Du, X. (2013) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdata.congress.2013.26 · Cited by 21
Relative Validity Criteria for Community Mining Algorithms
Rabbany, R., Takaffoli, M., Fagnan, J., Zaane, O. R., & Campello, R. J. G. B. (2012) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2012.52 · Cited by 20
Graph comparison via the nonbacktracking spectrum
Mellor, A., & Grusovin, A. (2019) · Physical review. E · doi:10.1103/physreve.99.052309 · Cited by 20
Accelerating exact constrained shortest paths on GPUs
Lu, S., He, B., Li, Y., & Fu, H. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3436905.3436914 · Cited by 21
BioCode: A Data-Driven Procedure to Learn the Growth of Biological Networks
Sefer, E. (2022) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2022.3165092 · Cited by 21
MiDaS: Representative Sampling from Real-world Hypergraphs
Choe, M., Yoo, J., Lee, G., Baek, W., Kang, U., & Shin, K. (2022) · International World Wide Web Conference (WWW) · doi:10.1145/3485447.3512157 · Cited by 22
Attacking the Core Structure of Complex Network
Zhou, B., Lv, Y., Wang, J., Zhang, J., & Xuan, Q. (2022) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2022.3188522 · Cited by 21
DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes
Meena, S. K., Singh, S. S., & Singh, K. (2024) · ACM Transactions on the Web · doi:10.1145/3664618 · Cited by 21
Graph Mining: Laws and Generators
Chakrabarti, D., Faloutsos, C., & McGlohon, M. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_3 · Cited by 21
Self-citationUsers in Volatile Communities: Studying Active Participation and Community Evolution
Falkowski, T., & Spiliopoulou, M. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73078-1_8 · Cited by 21
Community Detection in Dynamic Social Networks
Aston, N., & Hu, W. (2014) · Communications and Network · doi:10.4236/cn.2014.62015 · Cited by 21
Dynamic Social Network Analysis of a Dark Network: Identifying Significant Facilitators
Kaza, S., Hu, D., & Chen, H. (2007) · IEEE International Conference on Intelligence and Security Informatics (ISI) · doi:10.1109/isi.2007.379531 · Cited by 21
A social network based study of software team dynamics
Datta, S., Kaulgud, V., Sharma, V. S., & Kumar, N. (2010) · India Software Engineering Conference · doi:10.1145/1730874.1730883 · Cited by 21
Potential networks, contagious communities, and understanding social network structure
Schoenebeck, G. R. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488486 · Cited by 21
Pushing the Envelope in Graph Compression
Liakos, P., Papakonstantinopoulou, K., & Sioutis, M. (2014) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2661829.2662053 · Cited by 21
News Posting by Strategic Users in a Social Network
Gupte, M., Hajiaghayi, M., Han, L., Iftode, L., Shankar, P., & Ursu, R. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10841-9_65 · Cited by 21
Scalable and Robust Management of Dynamic Graph Data.
Labouseur, A. G., Olsen, P. W., & Hwang, J.-H. (2013) · Cited by 21
Network Connectivity Optimization
Chen, C., Peng, R., Ying, L., & Tong, H. (2018) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3219819.3220019 · Cited by 21
Tag2Vec: Learning Tag Representations in Tag Networks
Wang, J., Lu, Z., Song, G., Fan, Y. B., Du, L., & Lin, W. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313622 · Cited by 21
Detecting Changes in a Dynamic Social Network
McCulloh, I. (2009) · Cited by 21
Reciprocal versus parasocial relationships in online social networks
Gong, N. Z., & Xu, W. (2014) · Social Network Analysis and Mining · doi:10.1007/s13278-014-0184-6 · Cited by 22
Identifying significant facilitators of dark network evolution
Hu, D., Kaza, S., & Chen, H. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21008 · Cited by 21
Graph Size EstimationPreprint
Kurant, M., Butts, C. T., & Markopoulou, A. P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.0460 · Cited by 21
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
