Hierarchical structure and the prediction of missing links in networks
Open accessThe DOI matches its Crossref record; 34 of the 35 references it cites were found in a registry or an index.
Abstract
Networks have in recent years emerged as an invaluable tool for describing and quantifying complex systems in many branches of science. Recent studies suggest that networks often exhibit hierarchical organization, in which vertices divide into groups that further subdivide into groups of groups, and so forth over multiple scales. In many cases the groups are found to correspond to known functional units, such as ecological niches in food webs, modules in biochemical networks (protein interaction networks, metabolic networks or genetic regulatory networks) or communities in social networks. Here we present a general technique for inferring hierarchical structure from network data and show that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks, such as right-skewed degree distributions, high clustering coefficients and short path lengths. We further show that knowledge of hierarchical structure can be used to predict missing connections in partly known networks with high accuracy, and for more general network structures than competing techniques. Taken together, our results suggest that hierarchy is a central organizing principle of complex networks, capable of offering insight into many network phenomena.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Although previous work using complex networks theory has quantitatively tackled the problem [3, 4, 22-25, 27-31], some questions remain:”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [27]
The cited source says what the claim attributes to it.
In the citing paper
“Since edges in complex networks can often be explained via latent hierarchies over their nodes [8], we are interested in the benefits of Poincaré embeddings both in terms representation size and generalization performance.”
From Poincaré Embeddings for Learning Hierarchical Representations (2017) · cites this paper as [8]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
Hanley, J. A., & McNeil, B. J. (1982) · Radiology · doi:10.1148/radiology.143.1.7063747 · Cited by 21,856
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Self-citationSocial Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Self-citationFinding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Self-citation(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Casella, G., & Berger, R. (2024) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003456285 · Cited by 5,711
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Research works printed but not linked: 2
- Kleinberg, J. in Proc. 2001 Neural Inform. Processing Systems Conf. (eds Dietterich, T. G., Becker, S. & Ghahramani, Z.) 431–438 (MIT Press, Cambridge, MA, 2002)
- A. Lakhina, J. W. Byers, M. Crovella, P. Xie, Proc. INFOCOM (2003).
Cited by
Items 701–800 of 1,000
Link prediction and its optimization based on low-rank representation of network structures
Chai, L., Tu, L., Yu, X., Wang, X., & Chen, J. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119680 · Cited by 21
Hyperlink communities in higher-order networks
Lotito, Q. F., Musciotto, F., Montresor, A., & Battiston, F. (2024) · Journal of Complex Networks · doi:10.1093/comnet/cnae013 · Cited by 23
A hierarchical Dirichlet model for taxonomy expansion for search engines
Wang, J., Kang, C., Chang, Y., & Han, J. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2568037 · Cited by 21
“They apply the hierarchical random graph model[5] to infer a taxonomy over 541 nouns.”
MethodSonochemical Synthesis of Spherical BaTiO3Nanoparticles
Rayanasukha, S., Niemcharoen, S., Seeharaj, P., Vittayakorn, W. C., & Vittayakorn, N. (2013) · Ferroelectrics · doi:10.1080/00150193.2013.847332 · Cited by 21
“The difference between the XRD crystallite size and TEM primary particle size is thought to associate with the existence of hierarchical structure [15].”
BackgroundA framework to approach problems of forensic anthropology using complex networks
Caridi, I., Dorso, C. O., Gallo, P., & Somigliana, C. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.042 · Cited by 21
Weight prediction in complex networks based on neighbor set
Zhu, B., Xia, Y., & Zhang, X. (2016) · Scientific Reports · doi:10.1038/srep38080 · Cited by 21
Predicting links based on knowledge dissemination in complex network
Zhou, W., & Jia, Y. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.12.067 · Cited by 23
Similarity-based Regularized Latent Feature Model for Link Prediction in Bipartite Networks
Wang, W., Chen, X., Jiao, P., & Jin, D. (2017) · Scientific Reports · doi:10.1038/s41598-017-17157-9 · Cited by 21
“Besides the above prediction algorithms, some novel algorithms based on maximum-likelihood 7,9,10 have been proposed.”
BackgroundMethodConnecting Patterns Inspire Link Prediction in Complex Networks
Zhou, M., Liao, H., Xiong, W.-M., Wu, X., & Wei, Z.-W. (2017) · Complexity · doi:10.1155/2017/8581365 · Cited by 22
Percolation of hierarchical networks and networks of networks
Shekhtman, L., & Havlin, S. (2018) · Physical review. E · doi:10.1103/physreve.98.052305 · Cited by 21
Li, S., Huang, J., Liu, J., Huang, T., & Chen, H. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5094448 · Cited by 21
A Method for Geodesic Distance on Subdivision of Trees With Arbitrary Orders and Their Applications
Ma, F., Wang, P., & Luo, X. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3014191 · Cited by 23
“Social networks, for instance, display hierarchical structure such that ones can naturally employ treelike models, the so-called dendrograms, as a graphical representation and summary of the structure of this type [18].”
BackgroundMultilayer networks for text analysis with multiple data types
Hyland, C. C., Tao, Y., Azizi, L., Gerlach, M., Peixoto, T. P., & Altmann, E. G. (2021) · EPJ Data Science · doi:10.1140/epjds/s13688-021-00288-5 · Cited by 24
Reconstructing propagation networks with temporal similarity
Liao, H., & Zeng, A. (2015) · Scientific Reports · doi:10.1038/srep11404 · Cited by 26
“In link prediction and personalized recommendation, the main task is to estimate the likelihood of a nonexisting link to be an existing link in the future 3 .”
Integrin activation in the immune system
Laudanna, C., & Bolomini‐Vittori, M. (2009) · WIREs Systems Biology and Medicine · doi:10.1002/wsbm.9 · Cited by 24
Wu, Z., Lin, Y., Zhao, Y., & Yan, H. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.11.103 · Cited by 21
Open Community Challenge Reveals Molecular Network Modules with Key Roles in DiseasesPreprint
Choobdar, S., Ahsen, M. E., Crawford, J., Tomasoni, M., Fang, T., Lamparter, D., Lin, J., Hescott, B., Hu, X., Mercer, J., et al. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/265553 · Cited by 27
Gendron, M., Mesquita, B., & Barrett, L. F. (2020) · Culture, Mind, and Brain · doi:10.1017/9781108695374.010 · Cited by 20
Towards link inference attack against network structure perturbation
Xian, X., Wu, T., Liu, Y., Wang, W., Wang, C., Xu, G., & Xiao, Y. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106674 · Cited by 20
Sun, Y., Wang, C., Mi, W., Qu, Z., Mu, W., Wang, J., Zhang, J., & Wang, Q. (2022) · Journal of soil science and plant nutrition · doi:10.1007/s42729-022-01003-7 · Cited by 20
“4) (Newman 2006), thus indicating that the network had better modularity, and the bacterial network following irrigation with activated brackish water was scale-free, small world, and modular (Clauset et al. 2008).”
BackgroundLink prediction and feature relevance in knowledge networks: A machine learning approach
Zinilli, A., & Cerulli, G. (2023) · PLoS ONE · doi:10.1371/journal.pone.0290018 · Cited by 20
Category-tree-guided hierarchical knowledge transfer framework for zero-shot fault diagnosis
Zhang, B., Zhao, J., Chen, X., Yue, J., & Zhao, C. (2024) · Journal of Process Control · doi:10.1016/j.jprocont.2024.103267 · Cited by 21
Link prediction in social networks using hierarchical community detection
Deylami, H. A., & Asadpour, M. (2015) · International Conference on Information and Knowledge Technology (IKT) · doi:10.1109/ikt.2015.7288742 · Cited by 20
On the approximability of the link building problem
OLSEN, M. E., & Viglas, A. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.08.003 · Cited by 20
Potential links by neighbor communities
Xie, Z. Y., Dong, E., Li, J., Kong, D., & Wu, N. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.03.061 · Cited by 20
Navigational efficiency of broad vs. narrow folksonomies
Helić, D., Körner, C., Granitzer, M., Strohmaier, M., & Trattner, C. (2012) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/2309996.2310008 · Cited by 23
Detecting Genuine Communities from Large-Scale Social Networks: A Pattern-Based Method
Wu, Z., Cao, J., Wu, J., Wang, Y., & Liu, C. (2013) · The Computer Journal · doi:10.1093/comjnl/bxt113 · Cited by 23
“Some hierarchical models also seek to highlight communities by excluding unrelated nodes [39].”
BackgroundStrong associations between microbe phenotypes and their network architecture
Roy, S., & Filkov, V. (2009) · Physical Review E · doi:10.1103/physreve.80.040902 · Cited by 21
Infinite-degree-corrected stochastic block model
Herlau, T., Schmidt, M. N., & Mørup, M. (2014) · Physical Review E · doi:10.1103/physreve.90.032819 · Cited by 25
Liu, S., Ji, X., Liu, C., & Bai, Y. (2016) · International Journal of Modern Physics B · doi:10.1142/s0217979216502544 · Cited by 20
Modeling cascade formation in Twitter amidst mentions and retweets
Pramanik, S., Qinna Wang, A., Danisch, M., Guillaume, J., & Mitra, B. (2017) · Social Network Analysis and Mining · doi:10.1007/s13278-017-0462-1 · Cited by 20
“(2) Hierarchical Kronecker network (Clauset et al. 2008) can be thought of as a structure which encodes the organizational hierarchy.”
BackgroundMining and Forecasting Career Trajectories of Music Artists
Arakelyan, S., Morstatter, F., Martin, M. E., Ferrara, E., & Galstyan, A. (2018) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/3209542.3209554 · Cited by 20
“s often referred to as linkmining (a.k.a. linkprediction). Link mining is the problem of discovering new (unforeseen) edges in a graph. Typical possible applications are either network reconstruction [10, 15], or modeling the evolution of a network [5, 19, 41]. One common operationalization of link prediction is findi…”
BackgroundEffects of large-scale wetland loss on network connectivity of the Rainwater Basin, Nebraska
Verheijen, B. H. F., Varner, D. M., & Haukos, D. A. (2018) · Landscape Ecology · doi:10.1007/s10980-018-0721-1 · Cited by 23
Complex network analysis of forced synchronization in a hydrodynamically self-excited jet
Murugesan, M., Zhu, Y., & Li, L. K. B. (2019) · International Journal of Heat and Fluid Flow · doi:10.1016/j.ijheatfluidflow.2018.12.004 · Cited by 21
Activity Organization for Friend-Making Optimization in Online Social Networks
Shen, C.-Y., Yang, D.-N., Lee, W.-C., & Chen⋆, M.-S. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2980516 · Cited by 21
Gender bias in the Erasmus network of universities
Benedictis, L. D., & Leoni, S. (2020) · Applied Network Science · doi:10.1007/s41109-020-00297-9 · Cited by 20
“showing some major hubs and authorities, N is all cases not characterized by a hierarchical structure. Fitting G F 2008, G M 2008, G2013 and G M 2013 with a hierarchical random graph model, following [16] never give any statistical significance to an ordered structure in the network. The same result is obtained trimmin…”
BackgroundAnalysis of centrality measures under differential privacy models
Laeuchli, J., Ramírez-Cruz, Y., & Trujillo-Rasúa, R. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2021.126546 · Cited by 20
A New BAT and PageRank Algorithm for Propagation Probability in Social Networks
Yeh, W., Zhu, W., Huang, C., Hsu, T.-Y., Liu, Z., & Tan, S.-Y. (2022) · Applied Sciences · doi:10.3390/app12146858 · Cited by 20
Predicting missing links via effective paths
Zhu, X., Tian, H., & Cai, S. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.07.029 · Cited by 20
Predicting and Identifying Missing Node Information in Social Networks
Eyal, R., Rosenfeld, A., Sina, S., & Kraus, S. (2013) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2536775 · Cited by 20
“Previously, a Link Prediction Problem [Clauset et al. 2008; Liben-Nowell and Kleinberg 2007] was defined as attempting to locate which connections (edges) will soon exist between nodes.”
BackgroundMethodCycle and flow trusses in directed networks
Takaguchi, T., & Yoshida, Y. (2016) · Royal Society Open Science · doi:10.1098/rsos.160270 · Cited by 24
“Although there is no unifying definition of a community, information regarding communities in networks gives us a guide to summarize large-scale networks [6], to predict the existence of links [7], and to reveal functional organization in real networks [8, 9].”
BackgroundFuzzy descriptive evaluation system: real, complete and fair evaluation of students
Annabestani, M., Rowhanimanesh, A., Mizani, A., & Rezaei, A. (2020) · Soft Computing · doi:10.1007/s00500-019-04078-0 · Cited by 19
“They are various and we can find them in different topics such as estimation of network’s missing links (Clauset et al. 2008), organization of genetic in cortical surface area (Chen et al. 2012), primate cerebral cortex processing (Felleman and Essen 1991), analysis of group dynamics in pigeon…”
Link predication based on matrix factorization by fusion of multi class organizations of the network
Jiao, P., Cai, F., Feng, Y., & Wang, W. (2017) · Scientific Reports · doi:10.1038/s41598-017-09081-9 · Cited by 20
“…are generative mechanisms for the network and these methods build a model to fit the observed structure and estimate model parameters and then compute the linked probability of all the unobserved links in candidate set, such as the hierarchical structure model 17 and the stochastic block model 18 .”
BackgroundMethodMulti-Attribute Community Detection in International Trade Network
Grassi, R., Bartesaghi, P., Benati, S., & Clemente, G. P. (2021) · Networks and Spatial Economics · doi:10.1007/s11067-021-09547-4 · Cited by 19
Barbosa, C. R., Ramalhosa, E., Vasconcelos, I., Reis, M. S., & Mendes‐Ferreira, A. (2022) · Microorganisms · doi:10.3390/microorganisms10010107 · Cited by 20
Hyperbolic disc embedding of functional human brain connectomes using resting-state fMRI
Whi, W., Ha, S., Kang, H., & Lee, D. S. (2022) · Network Neuroscience · doi:10.1162/netn_a_00243 · Cited by 23
Exploring Overlapping Functional Units with Various Structure in Protein Interaction Networks
Zhang, X.-F., Dai, D., Ou-Yang, L., & Wu, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0043092 · Cited by 19
Alanis‐Lobato, G. (2015) · Frontiers in Genetics · doi:10.3389/fgene.2015.00296 · Cited by 20
“In the Hierarchical Random Graph (Clauset et al., 2008), the space of all possible dendrograms of a network is searched to get the ones that best fit its hierarchical structure.”
Subset Infinite Relational Models
Ishiguro, K., Ueda, N., & Sawada, H. (2012) · Cited by 19
Reconstructing direct and indirect interactions in networked public goods game
Han, X., Shen, Z., Wang, W.-X., Lai, Y., & Grebogi, C. (2016) · Scientific Reports · doi:10.1038/srep30241 · Cited by 22
“(1), the first term on the right-hand side is the payoff of participating in the self-centered PGG, and the second term is the payoffs of participating in ki neighbor-centered PGGs.”
BackgroundOgata, Y., Sakurai, N., Suzuki, H., Aoki, K., Saito, K., & Shibata, D. (2009) · International Conference on Genome Informatics (GIW) · doi:10.1142/9781848165632_0011 · Cited by 19
“powerful approach [1].”
Neural Link Prediction over Aligned Networks
Cao, X., Chen, H., Wang, X., Zhang, W., & Yu, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11260 · Cited by 19
“The representative models include hierarchical graph based models (Clauset, Moore, and Newman 2008) and latent factor models (Menon and Elkan 2011).”
MethodAn intermediary probability model for link prediction
Zhang, X., Pang, W., & Xia, Y. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.08.068 · Cited by 19
Maximum likelihood estimation of sparse networks with missing observations
Gaucher, S., & Klopp, O. (2021) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2021.04.003 · Cited by 19
“d and on available covariates. If these estimations are precise enough, testing for these interactions would enable scientists to establish the network topology while substantially reducing the costs [16]. In this context, estimating the probabilities of connections through likelihood maximization enables to according…”
BackgroundMeasuring complexityPreprint
Wiesner, K., & Ladyman, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.13243 · Cited by 28
“[82] A.”
Challenges and opportunities in the network medicine of complex diseases
d’Andrea, V., Loscalzo, J., & Domenico, M. D. (2025) · Med · doi:10.1016/j.medj.2025.100920 · Cited by 21
Vulnerability of scale-free cryptocurrency networks to double-spending attacks
Zhang, J., Xu, Y., & Houser, D. E. (2021) · European Journal of Finance · doi:10.1080/1351847x.2021.1886964 · Cited by 18
“And hierarchical networks are networks combining the scale-free property with a high degree of clustering (Clauset, Moore, and Newman 2008).”
Hierarchical core-periphery structure in networks
Polanco, A., & Newman, M. E. J. (2023) · Physical review. E · doi:10.1103/physreve.108.024311 · Cited by 23
“…in recent years to analyzing and understanding large-scale structure in such networks, especially community structure [3, 4], but also nested [3, 5] and overlapping [6, 7] communities and strat-ification [8, 9], as well as the related issues of embedding and graph representation learning [10].”
BackgroundSelf-citationComparing discriminating abilities of evaluation metrics in link prediction
Jiao, X., Wan, S. M., Liu, Q., Bi, Y., Lee, Y.-L., Xu, E., Dong, H., & Zhou, T. (2024) · Journal of Physics Complexity · doi:10.1088/2632-072x/ad46be · Cited by 20
Measuring the Global Digital Technology Innovation Network in the Construction Industry
Xue, X., Tan, X., Ji, A., & Xue, W. (2024) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2024.3399758 · Cited by 20
“Network analysis has been used as an invaluable tool for describing and quantifying complex systems in many branches ofscience[18].”
MethodLink Prediction in Complex Networks Using Average Centrality-Based Similarity Score
Nandini, Y. V., Lakshmi, T. J., Enduri, M. K., & Sharma, H. (2024) · Entropy · doi:10.3390/e26060433 · Cited by 18
“These algorithms are classified into three groups: similarity-based measures [10,11], probabilistic measures [12], and dimensionality-based measures [13].”
BackgroundOCMiner: A density-based overlapping community detection method for social networks
Bhat, S. Y., & Abulais, M. (2015) · Intelligent Data Analysis · doi:10.3233/ida-150751 · Cited by 18
“Numerous meth-ods based on spectral clustering [11,46,55], partitional clustering [33], mathematical programming [1], and latent space clustering [18] along with modularity-based algorithms [8,37] and likelihood-based algorithms [7] have been developed for community detection in social networks.”
Global Geometric Affinity for Revealing High Fidelity Protein Interaction Network
Fang, Y., Benjamin, W., Sun, M., & Ramani, K. (2011) · PLoS ONE · doi:10.1371/journal.pone.0019349 · Cited by 18
“The AUC is often interpreted as the probability that a randomly chosen missing connected pair of nodes (true positive) is given a higher score by GGA than a randomly chosen unconnected pair of nodes (true negative) [26].”
BackgroundMethodInfluentialThe interaction between multiplex community networks
Hao, J., Cai, S., He, Q., & Liu, Z. (2011) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3534792 · Cited by 18
DNE: A Method for Extracting Cascaded Diffusion Networks from Social Networks
Eslami, M., Rabiee, H. R., & Salehi, M. (2011) · International Conference on Social Computing · doi:10.1109/passat/socialcom.2011.85 · Cited by 19
“For the Kronecker model, we consider three different networks: Hierarchical [18], Random [24] and CorePeriphery network [25].”
BackgroundMethodWu, K., Liu, J., & Wang, S. (2016) · Scientific Reports · doi:10.1038/srep37771 · Cited by 19
“Clearly, different choices for λ in equation (9) will yield different optimal solutions, so, we can obtain a set of solutions by using the lasso with different values of λ .”
InfluentialDisjoint Community Detection in Networks Based on the Relative Association of Members
Taha, K. (2018) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2018.2822738 · Cited by 18
“The hierarchy-centric methods [1], [2], [8], [18], [26], [28], [42] detect communities by constructing a hierarchical structure of communities based on the topology of the network.”
BackgroundMethodModeling Large-Scale Dynamic Social Networks via Node Embeddings
Zhiyuli, A., Liang, X., Chen, Y., & Du, X. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2872602 · Cited by 18
“fact that social networks are inherently hierarchical [37].”
BackgroundNazarnia, H., & Sarmasti, H. (2018) · Civil Engineering Journal · doi:10.28991/cej-03091165 · Cited by 18
“In fact, the clustering coefficient is defined as a measure of the probability for a link to exist between any two neighbors of a node; in other words, clustering coefficient is a measure which quantifies the connectivity of the neighbor nodes [16, 28, 29, 46].”
BackgroundMethodTemporal similarity metrics for latent network reconstruction: The role of time-lag decay
Liao, H., Liu, M., Mariani, M. S., Zhou, M., & Wu, X. (2019) · Information Sciences · doi:10.1016/j.ins.2019.01.081 · Cited by 18
Recent advance on detecting core-periphery structure: a survey
Tang, W., Zhao, L., Liu, W., Liu, Y., & Yan, B. (2019) · CCF Transactions on Pervasive Computing and Interaction · doi:10.1007/s42486-019-00016-z · Cited by 20
Overlapping communities and the prediction of missing links in multiplex networks
Abdolhosseini-Qomi, A. M., Yazdani, N., & Asadpour, M. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124650 · Cited by 18
Link Weight Prediction Using Weight Perturbation and Latent Factor
Cao, Z., Zhang, Y., Guan, J., Zhou, S., & Chen, G. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2995595 · Cited by 18
One model to rule them all in network science?
Guimerà, R. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2017807117 · Cited by 22
Ma, C., Lin, Q., Yong, L., & Ma, X. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106666 · Cited by 18
Community structure inhibits cooperation in the spatial prisoner’s dilemma
Wu, J., Hou, Y., Jiao, L., & Li, H. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.06.042 · Cited by 18
Isogai, T. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu023 · Cited by 22
Dense and sparse graph partition
Darlay, J., Brauner, N., & Moncel, J. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.06.004 · Cited by 18
“Many empirical problems can be modeled as networks that divide naturally into communities, for instance protein interactions, social interactions, etc [7,17,25].”
BackgroundOptimizing the controllability index of directed networks with the fixed number of control nodes
Ding, J. J., Tan, P., & Lu, Y.-Z. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.07.102 · Cited by 18
Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS
Nejad, M., Mashayekhy, L., Chinnam, R. B., & Phillips, A. M. (2015) · IIE Transactions · doi:10.1080/0740817x.2015.1078523 · Cited by 18
“Instead of a functional class representation, we employ an emerging concept in analyzing complex networks called “community structure detection” (Clauset et al., 2008; Newman, 2011) to form hierarchical community-based representations of road networks efficiently (Newman, 2004; Blon-del et al., 2008).”
BackgroundMethodXiao, L., Guo, C. G., Sun, J., Han, S., & Zhang, C. (2016) · Scientometrics · doi:10.1007/s11192-016-2051-x · Cited by 18
“Clauset et al. (2008) produced a dendrogram with a set of probabilities as a graphical representation and summary of a network’s hierarchical structure.”
InfluentialTopological redundancy and ‘small‐world’ patterns in a food web in a subtropical ecosystem of Brazil
Bornatowski, H., Barreto, R. R. P., Navia, A. F., & de Amorim, A. F. (2016) · Marine Ecology · doi:10.1111/maec.12407 · Cited by 18
Fast link prediction for large networks using spectral embedding
Pachev, B., & Webb, B. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx021 · Cited by 19
“Keywords: link prediction; graph embedding; commute time; resistance distance; closest pairs.”
BackgroundPolicy Modeling and Applications: State‐of‐the‐Art and Perspectives
Furtado, B. A., Fuentes, M., & Tessone, C. J. (2019) · Complexity · doi:10.1155/2019/5041681 · Cited by 21
Structural Analysis of Criminal Network and Predicting Hidden Links using Machine LearningPreprint
Budur, E., Lee, S., & Kong, V. S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.05739 · Cited by 18
Yang, D., Sun, Y., Wei, Q., Zhang, H., & Li, T. (2021) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2021.3131490 · Cited by 17
Coarse-graining network flow through statistical physics and machine learning
Zhang, Z., Ghavasieh, A., Zhang, J., & Domenico, M. D. (2025) · Nature Communications · doi:10.1038/s41467-025-56034-2 · Cited by 26
“First,wegatheradatasetwith2,193real-worldnetworksspanning various domains, from brains and biological to social and more, with the number of nodes ranging from 100 to 2, 495, from Network Repository (NR) 75 (for more information about the dataset, training, and testing process, please see Supplementary Note 6).”
Enhanced link clustering with observations on ground truth to discover social circles
Hu, Y., & Yang, B. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.10.006 · Cited by 17
Scaling of clusters near discontinuous percolation transitions in hyperbolic networks
Singh, V., & Boettcher, S. (2014) · Physical Review E · doi:10.1103/physreve.90.012117 · Cited by 19
Local degree blocking model for link prediction in complex networks
Liu, Z., Dong, W., & Fu, Y. (2015) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4906371 · Cited by 17
Research on Single Nucleotide Polymorphisms Interaction Detection from Network Perspective
Su, L., Liu, G., Wang, H., Tian, Y., Zhou, Z., Han, L., & Yan, L. (2015) · PLoS ONE · doi:10.1371/journal.pone.0119146 · Cited by 19
Planar unclustered scale-free graphs as models for technological and biological networks
Miralles, A., Comellas, F., Chen, L., & Zhang, Z. (2010) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.12.056 · Cited by 19
“Their models try to match observational studies which have identified at least three important common characteristics for real-life networks: They exhibit a small average distance and diameter (compared to a random network with the same number of nodes and links); the number of links attached to the nodes obeys a powe…”
BackgroundHavemann, F., Gläser, J., Heinz, M., & Struck, A. (2012) · PLoS ONE · doi:10.1371/journal.pone.0033255 · Cited by 17
SIMILARITY INDEX BASED ON THE INFORMATION OF NEIGHBOR NODES FOR LINK PREDICTION OF COMPLEX NETWORK
Wang, J., & Rong, L. (2013) · Modern Physics Letters B · doi:10.1142/s0217984913500395 · Cited by 17
CD-Based Indices for Link Prediction in Complex Network
Wang, T., Wang, H., & Wang, X. (2016) · PLoS ONE · doi:10.1371/journal.pone.0146727 · Cited by 19
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
RetractedRobustness of Link Prediction Under Network Attacks
Pu, C., Wang, K., & Xia, Y. (2019) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2019.2938894 · Cited by 17
“Various link prediction methods have been proposed [7], and are broadly divided into four categories: structural similarity based methods (such as the Common Neighbor (CN) [8] and Adamic-Adar (AA) [9] indices), maximum likelihood based methods (such as the hierarchical structure model [10] and stochastic block model […”
Predicting links between tumor samples and genes using 2-Layered graph based diffusion approach
Timilsina, M., Yang, H., Sahay, R., & Rebholz‐Schuhmann, D. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-3056-2 · Cited by 18
“This technique has been widely discussed in the link prediction literature [72, 79–81].”
MethodA framework for second-order eigenvector centralities and clustering coefficients
Arrigo, F., Higham, D. J., & Tudisco, F. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0724 · Cited by 23
“(a) in a dynamic network where new connections appear over time, and (b) in a noisily observed network, where it is suspected that edges are missing [11, 34, 35].”
BackgroundClustering for epidemics on networks: A geometric approach
Prasse, B., Devriendt, K., & Mieghem, P. V. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0048779 · Cited by 17
Metadata
- Authors
- Clauset, A., Moore, C., & Newman, M. E. J.
- Affiliations
- University of New Mexico (US)
- Santa Fe Institute (US)
- Corresponding author
- Clauset, Aaron
- Venue
- Nature
- Published
- 2008-05
- Volume
- 453
- Issue
- 7191
- Pages
- 98-101
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2157082398
- Cited by
- 2,171
- References
- 35
- Citations by year
- 2026: 35 · 2025: 58 · 2024: 78 · 2023: 99 · 2022: 157 · 2021: 152 · 2020: 167 · 2019: 141 · 2018: 170 · 2017: 132 · 2016: 162 · 2015: 127 · 2014: 131 · 2013: 128 · 2012: 115
- FWCI
- 81.70
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Deep Blue (University of Michigan) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- University of Michigan
- Santa Fe Institute
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- network hierarchy, missing link prediction, community detection, complex networks, incomplete network data, degree distribution, clustering coefficient, network topology, protein-protein interaction network, food webs, social networks
- MeSH terms
- Algorithms, Models, Biological, Probability, Protein Binding, Sensitivity and Specificity, Social Behavior, Food Chain, Gene Regulatory Networks, Metabolic Networks and Pathways, Biosynthetic Pathways
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.