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 401–500 of 1,000
Link prediction in complex networks based on Significance of Higher-Order Path Index (SHOPI)
Kumar, A., Mishra, S., Singh, S. S., Singh, K., & Biswas, B. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.123790 · Cited by 47
Disentangling Homophily, Community Structure, and Triadic Closure in Networks
Peixoto, T. P. (2022) · Physical Review X · doi:10.1103/physrevx.12.011004 · Cited by 74
“A common use of network models is to predict such erroneous and missing information from what is more precisely known [34, 35].”
BackgroundDeciphering the connectivity structure of biological networks using MixNet
Picard, F., Miele, V., Daudin, J., Cottret, L., & Robin, S. S. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-s6-s17 · Cited by 50
“Deciphering rules that govern their formation and evolution has received much attention [16], and the study of their structure is also an active research field [5, 17 ].”
BackgroundMethodInfluentialA fusion probability matrix factorization framework for link prediction
Wang, Z., Liang, J., & Li, R. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.06.005 · Cited by 46
“The hierarchical network model [56] models a network as a hierarchical random graph and the linking possibility between nodes can be calculated by the probability expectation.”
BackgroundMethodDeep multi-granularity graph embedding for user identity linkage across social networks
Fu, S., Wang, G., Xia, S., & Liu, L. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.105301 · Cited by 49
ComGCN: Community-Driven Graph Convolutional Network for Link Prediction in Dynamic Networks
Pham, P., Nguyen, L. T. T., Nguyên, N. T., Pedrycz, W., Yun, U., & Vo, B. (2021) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2021.3130149 · Cited by 48
Link prediction in a user–object network based on time-weighted resource allocation
Liu, J., & Deng, G. (2009) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.05.021 · Cited by 46
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
Krioukov, D., Papadopoulos, F., Boguñá, M., & Vahdat, A. (2009) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1639562.1639568 · Cited by 46
“The relationships between such groups and subgroups, called communities [19], can be approximated by tree-like structures, in which the distance between two nodes estimates how similar they are [20], [21].”
BackgroundSuperedge prediction: What opinions will be mined based on an opinion supernetwork model?
Liu, Y., Li, Q., Tang, X., Ma, N., & Ruya, T. (2014) · Decision Support Systems · doi:10.1016/j.dss.2014.05.011 · Cited by 47
Community detection in complex networks using extended compact genetic algorithm
Li, J., & Song, Y. (2012) · Soft Computing · doi:10.1007/s00500-012-0942-1 · Cited by 50
“In Clauset et al. (2007, 2008), the concept of hierarchical random graphs is introduced to describe the hierarchical organization structure of a graph.”
BackgroundEfficient incremental dynamic link prediction algorithms in social network
Zhang, Z., Wen, J., Sun, L., Deng, Q., Su, S., & Yao, P. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.06.035 · Cited by 45
Insights from the study of complex systems for the ecology and evolution of animal populations
Fisher, D. N., & Pruitt, J. N. (2019) · Current Zoology · doi:10.1093/cz/zoz016 · Cited by 52
“Clauset et al. (2008) also provide a simple model that generates networks that are hierarchically structured, and found that it re-created other properties of metabolic networks, networks of terrorists, and networks among different grassland species.”
BackgroundChen, G., Xu, C. G., Wang, J., Feng, J., & Feng, J. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.08.068 · Cited by 45
Network strategies to understand the aging process and help age-related drug design
Simkó, G. I., Gyurkó, D. M., Veres, D. V., Nánási, T., & Csermely, P. (2009) · Genome Medicine · doi:10.1186/gm90 · Cited by 51
“More over, modern networkprediction methods [31] may also be able to predict links and network elements that should be a part of the network, but that have not yet been identified.”
Link Prediction Across Multiple Social Networks
Ahmad, M. A., Borbora, Z. H., Srivastava, J., & Contractor, N. (2010) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2010.79 · Cited by 50
“Clauset et al [6] describe a maximum likelihood based approach combined with Monte-Carlo Algorithm and fit a hierarchical model on a network graph to make link predictions .”
MethodRestricted Boltzmann Machine-Based Approaches for Link Prediction in Dynamic Networks
Li, T., Wang, B., Jiang, Y., Zhang, Y. T., & Yan, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2840054 · Cited by 44
“[11] proposed a hierarchical random graph model to infer hierarchical structure from network, but it is computationally expensive, and is limited to deal with networks with thousands of nodes.”
BackgroundA classification approach to link prediction in multiplex online ego-social networks
Rezaeipanah, A., Ahmadi, G., & Matoori, S. S. (2020) · Social Network Analysis and Mining · doi:10.1007/s13278-020-00639-6 · Cited by 47
“A brilliant study has been accomplished on the predicting of missing links in social networks (Al Hasan and Zaki 2011; Clauset et al. 2008).”
BackgroundHypergraph reconstruction from dynamics
Delabays, R., Pasquale, G. D., Dörfler, F., & Zhang, Y. (2025) · Nature Communications · doi:10.1038/s41467-025-57664-2 · Cited by 65
“For instance, in the context of predicting missing links [71], the majority of the (hyper)edges are known.”
Stochastic block model and exploratory analysis in signed networks
Jiang, J. Q. (2015) · Physical Review E · doi:10.1103/physreve.91.062805 · Cited by 57
“tist University, Kowloon Tong, Hong Kong to enable an “exploratory” analysis of networks, allowing us to extract unspecified structural patterns even if some edges in the networks are missing [28, 29].”
BackgroundOne Plus One Makes Three (for Social Networks)
Horvát, E.-Á., Hanselmann, M., Hamprecht, F. A., & Zweig, K. A. (2012) · PLoS ONE · doi:10.1371/journal.pone.0034740 · Cited by 55
Kininmonth, S., van Oppen, M. J. H., & Possingham, H. P. (2010) · Ecological Modelling · doi:10.1016/j.ecolmodel.2010.08.042 · Cited by 43
Playing the role of weak clique property in link prediction: A friend recommendation model
Ma, C., Zhou, T., & Zhang, H. (2016) · Scientific Reports · doi:10.1038/srep30098 · Cited by 43
Community-based link prediction
Biswas, A., & Biswas, B. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-016-4270-9 · Cited by 43
“Two kinds of organizing models of network are developed: hierarchical structure model [16] and stochastic block model [26].”
MethodWang, W., Feng, Y., Jiao, P., & Yu, W. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.09.020 · Cited by 43
Chen, H., Chen, X., & Liu, H. (2018) · PLoS ONE · doi:10.1371/journal.pone.0192545 · Cited by 47
The nature of organized crime leadership: criminal leaders in meeting and wiretap networks
Calderoni, F., & Superchi, E. (2019) · Crime Law and Social Change · doi:10.1007/s10611-019-09829-6 · Cited by 51
“Furthermore, several studies reject the concerns about network completeness, arguing that, under conditions, judicial sources are reliable for the analysis of criminal groups ([26, 59], Chapter 5); that network measures are reliable even if randomly tested for missing data [6, 101]; and that network analysis may even…”
BackgroundLink prediction in dynamic networks based on the attraction force between nodes
Chi, K., Yin, G., Dong, Y., & Dong, H. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.05.035 · Cited by 43
A novel graph mining approach to predict and evaluate food-drug interactions
Rahman, M. M., Vadrev, S. M., Magana-Mora, A., Levman, J. E. D., & Soufan, O. (2022) · Scientific Reports · doi:10.1038/s41598-022-05132-y · Cited by 46
“…many application domains such as, identifying protein–protein interactions 45 , drug-drug interactions 29 , DTIs 28 , social networks 46 , reconstructing networks 47 , document recommendation, recommendation systems 48 , biological networks 49 , disease prediction 50 , bipartite networks 51 , etc.”
BackgroundKim, H., Hong, S., Kwon, O.-J., & Lee, C. (2017) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2017.02.025 · Cited by 43
A link prediction algorithm based on ant colony optimization
Chen, B., & Chen, L. (2014) · Applied Intelligence · doi:10.1007/s10489-014-0558-5 · Cited by 47
“Typical organizing models of the network are the hierarchical structure model [37] and the stochastic block model [38–40] .”
An experimental test of a fundamental food web motif
Rip, J. M. K., McCann, K. S., Lynn, D. H., & Fawcett, S. (2010) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2009.2191 · Cited by 49
“Second, these complex food web networks are known to have a hierarchical structure with some motifs repeated at a variety of hierarchical scales (Clauset et al. 2008).”
BackgroundLink Prediction in Evolving Networks Based on Popularity of Nodes
Wang, T., He, X., Zhou, M., & Fu, Z. (2017) · Scientific Reports · doi:10.1038/s41598-017-07315-4 · Cited by 42
Link Prediction in Complex Networks
Pujari, M., & Kanawati, R. (2020) · IGI Global eBooks · doi:10.4018/978-1-7998-2460-2.ch061 · Cited by 42
Toward an organismal, integrative, and iterative phylogeography
Buckley, D. (2009) · BioEssays · doi:10.1002/bies.200800162 · Cited by 42
“Networks could be used to infer and test models of population structure, connectivity and dynamics,((59)) to detect missing links in a structured system((60)) and to understand hierarchical relations of individual within and between populations.”
MethodHao, D., Ren, C., & Li, C. (2012) · BMC Systems Biology · doi:10.1186/1752-0509-6-34 · Cited by 46
“It has been found that many complex systems have hierarchical organization, including social networks that are known to be assortative and lack the variation of C(k) [26,27].”
BackgroundCharacterizing and Extracting Multiplex Patterns in Complex Networks
Yang, B., Liu, J., & Liu, D. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2167751 · Cited by 43
Link prediction in directed social networks
Schall, D. (2014) · Social Network Analysis and Mining · doi:10.1007/s13278-014-0157-9 · Cited by 45
“Further methods for link prediction include hierarchical models (Clauset et al. 2008), stochastic block models (Airoldi et al. 2008; Holland et al. 1983; White et al. 1976), probabilistic models (Lu and Zhou 2011), and methods considering positive/negative links (Symeonidis and Mantas 2013) (see…”
MethodThe degree-related clustering coefficient and its application to link prediction
Liu, Y., Zhao, C., Wang, X., Huang, Q., Zhang, X., & Yi, D. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.02.014 · Cited by 41
Network Analysis as a Grand Unifier in Biomedical Data Science
McGillivray, P. D., Clarke, D., Meyerson, W. U., Zhang, J., Lee, D., Gu, M., Kumar, S., Zhou, H., & Gerstein, M. (2018) · Annual Review of Biomedical Data Science · doi:10.1146/annurev-biodatasci-080917-013444 · Cited by 49
Topics at the Frontier of Statistics and Network Analysis (Re)Visiting the Foundations
Kolaczyk, E. D. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108290159 · Cited by 62
Predictability of real temporal networks
Tang, D., Du, W., Shekhtman, L., Wang, Y., Havlin, S., Cao, X., & Yan, G. (2020) · National Science Review · doi:10.1093/nsr/nwaa015 · Cited by 46
“This question is much broader and distinct from time-series forecasting [17–19], which aims to predict the future evolution of single variables, and link prediction [20–23], the goal of which is to uncover the missing or future links in static networks.”
BackgroundKoçdar, S., Bozkurt, A., & Doğan, T. G. (2020) · Computer Applications in Engineering Education · doi:10.1002/cae.22367 · Cited by 46
An Interdependent Multi-Layer Model: Resilience of International Networks
Caschili, S., Medda, F., & Wilson, A. G. (2015) · Networks and Spatial Economics · doi:10.1007/s11067-014-9274-2 · Cited by 47
“Networks are ubiquitous across societies and economies in the form of physical networks such as transportation, communication and utility services, and also as intangible economic, financial and social networks (Caschili et al. 2014; Clauset et al. 2008; Newman 2003; Strogatz 2001).”
BackgroundPredicting Co-Author Relationship in Medical Co-Authorship Networks
Yu, Q., Long, C., Lv, Y., Shao, H., Pei-feng, H., & Duan, Z. (2014) · PLoS ONE · doi:10.1371/journal.pone.0101214 · Cited by 45
“Link prediction problems have been explored in different networks, such as web page networks [4,5], food webs [12], protein networks [11,13,14], gene regulatory networks [15], adverse drug reaction networks [16], social communities networks [17,18], co-authorship networks [2,3,10,19,20], and paper citation networks [2…”
BackgroundDai, Q., & Gao, Y. (2023) · Artificial intelligence: foundations, theory, and algorithms/Artificial intelligence: Foundations, theory, and algorithms · doi:10.1007/978-981-99-0185-2 · Cited by 44
Non-Hyperbolicity of Random Graphs with Given Expected Degrees
Shang, Y. (2013) · Stochastic Models · doi:10.1080/15326349.2013.838510 · Cited by 45
“Gromov hyperbolicity turns out to be very important not only in geometric group theory and geometry of negatively curved spaces[6] but also in diverse applied fields such as cybersecurity [16], sensor networks[17,20], DNA data analysis[5], and statistical physics[12,18,23].”
BackgroundWang, Z., Liang, J., Li, R., & Qian, Y. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2597823 · Cited by 40
“[1] proposed a hierarchical network model, in which a network could be modelled by a hierarchical random graph where leaves correspond to the nodes of network and internal nodes correspond to the linking probability between leaf nodes.”
BackgroundPredicting missing links via correlation between nodes
Liao, H., Zeng, A., & Zhang, Y. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.05.009 · Cited by 41
Revealing the predictability of intrinsic structure in complex networks
Sun, J., Feng, L., Xie, J., Ma, X., Wang, D., & Hu, Y. (2020) · Nature Communications · doi:10.1038/s41467-020-14418-6 · Cited by 49
Cimini, G., Mastrandrea, R., & Squartini, T. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108771030 · Cited by 53
“The Hierarchical Random Graph Model (Clauset et al., 2008) assigns a probability pr to each internal node r, so that the connection probability of a pair of nodes (leaves) is equal to pr′ , where r ′ is the lowest common ancestor of these two nodes.”
BackgroundReliable network inference from unreliable data: A tutorial on latent network modeling using STRAND.
Redhead, D., McElreath, R. L., & Ross, C. T. (2023) · Psychological Methods · doi:10.1037/met0000519 · Cited by 51
Using Transcription Modules to Identify Expression Clusters Perturbed in Williams-Beuren Syndrome
Henrichsen, C. N., Csárdi, G., Zabot, M.-T., Fusco, C., Bergmann, S., Merla, G., & Reymond, A. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001054 · Cited by 39
“We fitted hierarchical models [60] to the subnetwork of frequent module genes, and also to 1,000 randomized networks.”
MethodInfluentialA testing based extraction algorithm for identifying significant communities in networks
Wilson, J. D., Wang, S., Mucha, P. J., Bhamidi, S., & Nobel, A. B. (2014) · The Annals of Applied Statistics · doi:10.1214/14-aoas760 · Cited by 54
Models of human navigation in information networks based on decentralized search
Helić, D., Strohmaier, M., Granitzer, M., & Scherer, R. (2013) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/2481492.2481502 · Cited by 39
“Such hierarchical structure typically leads to the emergence of observable structural properties such as power-law degree distributions and high node clustering (cf. [4]).”
BackgroundA Divide-and-Link algorithm for hierarchical clustering in networks
Gómez, D., Zarrazola, E., Yáñez, J., & Montero, J. (2015) · Information Sciences · doi:10.1016/j.ins.2015.04.011 · Cited by 40
“For example, as pointed out in [4], the knowledge of hierarchical structure can be used to predict missing connections in a more realistic way.”
BackgroundZhang, J., McBurney, P., & Musiał, K. (2017) · Review of Quantitative Finance and Accounting · doi:10.1007/s11156-017-0631-3 · Cited by 40
Hierarchical Community Structure Preserving Network Embedding: A Subspace Approach
Long, Q., Wang, Y., Du, L., Song, G., Jin, Y., & Lin, W. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3357947 · Cited by 41
“Even more remarkably, not only do vertices form communities, the communities thus formed are commonly organized in a hierarchical manner as well, which proves to be significantly indicative of functional components of the underlying networks [3, 4].”
BackgroundDo you need cobalt ore? Estimating potential trade relations through link prediction
Liu, S., Dong, Z., Ding, C., Wang, T., & Zhang, Y. (2020) · Resources Policy · doi:10.1016/j.resourpol.2020.101632 · Cited by 39
Hierarchical community structure in networks
Schaub, M. T., Li, J., & Peel, L. (2023) · Physical review. E · doi:10.1103/physreve.107.054305 · Cited by 51
“Previous approaches either employ Markov chain Monte Carlo methods [2, 4], for which convergence can be slow and difficult to diagnose, or rely on approximate heuristics that scale quadratically with the number of nodes in the network [3] and are thus limited to relatively small networks.”
BackgroundMethodInfluentialSeeding the Kernels in graphs: toward multi-resolution community analysis
Zhang, J., Zhang, K., Xu, X.-K., Tse, C. K., & SMALL, M. P. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/11/113003 · Cited by 41
Universal data-based method for reconstructing complex networks with binary-state dynamics
Li, J., Shen, Z., Wang, W.-X., Grebogi, C., & Lai, Y. (2017) · Physical review. E · doi:10.1103/physreve.95.032303 · Cited by 40
“Reconstructing the topological structure and dynamics of complex systems from data is a central issue in both network science and engineering community [22,24,25,27,28,32,58,59].”
BackgroundLarge scale methods to enumerate extreme rays and elementary modes
Terzer, M. (2009) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005945733 · Cited by 57
“Available methods, thus, have limitations in automatically generating predictive network models and novel concepts such as (Clauset et al., 2008) are needed.”
MethodSingh, S. S., Srivastava, V., Kumar, A., Tiwari, S., Singh, D., & Lee, H.-N. (2022) · ACM Transactions on Asian and Low-Resource Language Information Processing · doi:10.1145/3539732 · Cited by 43
“Link Prediction Similarity-based Local Similarity Indices [49, 91, 102, 203] Global Similarity Indices [19, 28] Probabilistic & Likelihood Hierarchical Structure [40] Stochastic Block [176, 192] Parametric [82] Graph Factorization [109] Dimensionality Reduction Embedding-based [25] Matrix Factorization [86] Informatio…”
MethodUncovering regional characteristics from mobile phone data: A network science approach
Chi, G., Thill, J., Tong, D., Shi, L., & Liu, Y. (2016) · Papers of the Regional Science Association · doi:10.1111/pirs.12149 · Cited by 40
On the categorization of scientific citation profiles in computer science
Chakraborty, T., Kumar, S., Goyal, P., Ganguly, N., & Mukherjee, A. (2015) · Communications of the ACM · doi:10.1145/2701412 · Cited by 43
“believe that a systematic machine learning model of the behavior of different citation patterns has the potential to enhance the standard research methodology in this area which includes topics like discovering missing links in citation networks [10], early prediction of citations of scientific articles [31], predicti…”
BackgroundCredit Default Swaps Drawup Networks: Too Interconnected to Be Stable?
Kaushik, R., & Battiston, S. (2013) · PLoS ONE · doi:10.1371/journal.pone.0061815 · Cited by 41
Dense Neighborhoods on Affinity Graph
Liu, H., Yang, X., Latecki, L. J., & Yan, S. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-011-0496-1 · Cited by 38
On the basic computational structure of gene regulatory networks
Rodríguez-Caso, C., Corominas-Murtra, B., & Solé, R. V. (2009) · Molecular BioSystems · doi:10.1039/b904960f · Cited by 41
Recommending Positive Links in Signed Social Networks by Optimizing a Generalized AUC
Song, D., & Meyer, D. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9167 · Cited by 41
The role of direct links for link prediction in evolving networks
Shang, K.-K., SMALL, M. P., Xu, X.-K., & Yan, W.-S. (2017) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/117/28002 · Cited by 38
Influence of edge weight on node proximity based link prediction methods: An empirical analysis
Sett, N., Singh, S. R., & Nandi, S. (2015) · Neurocomputing · doi:10.1016/j.neucom.2014.11.089 · Cited by 38
“The AUC value is equivalent to the probability of a randomly chosen positive instance having higher prediction score than a randomly chosen negative instance [7,19,21].”
BackgroundFinding missing links in interaction networks
Terry, J. C. D., & Lewis, O. T. (2020) · Ecology · doi:10.1002/ecy.3047 · Cited by 44
Fan, J., Meng, J., Ludescher, J., Li, Z., Surovyatkina, E. D., Chen, X., Kurths, J., & Schellnhuber, H. J. (2021) · Journal of Climate · doi:10.1175/jcli-d-21-0063.1 · Cited by 49
Newman, M. E. J. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198805090.003.0001 · Cited by 38
Self-citationFamilial groups in social networks
Nastos, J., & Gao, Y. (2013) · Social Networks · doi:10.1016/j.socnet.2013.05.001 · Cited by 45
“With our definition of forbidding certain 4-vertex graphs, this opens the door to new structural analysis possibilities, such as probabilistic modeling techniques used in Clauset et al. (2008) or Faust (2008).”
BackgroundMethodInfluentialPredicting top-Lmissing links with node and link clustering information in large-scale networks
Wu, Z., Lin, Y., Wan, H., & Jamil, W. (2016) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2016/08/083202 · Cited by 45
A framework for statistical network modelingPreprint
Crane, H., & Dempsey, W. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.08185 · Cited by 43
“Community detection [56] is a primary example, as is missing link estimation [12, 37].”
BackgroundScalable Influence Maximization for Multiple Products in Continuous-Time Diffusion NetworksPreprint
Du, N., Liang, Y., Balcan, M.-F., Gomez-Rodriguez, M., Hongyuan Zha, B., & Song, L. (2016) · Journal of Machine Learning Research · doi:10.48550/arxiv.1612.02712 · Cited by 46
“…which mimic the information diffusion traces in real-world networks (Gomez-Rodriguez et al., 2011), ( ii ) random networks ([0.5 0.5; 0.5 0.5]), typically used in physics and graph theory (Easley and Kleinberg, 2010) and ( iii ) hierarchical networks ([0.9 0.1; 0.1 0.9]) (Clauset et al., 2008).”
MethodInfluentialNetwork-Based Methods and Their Applications in Drug Discovery
Yu, Z., Wu, Z., Wang, Z., Wang, Y., Zhou, M., Li, W., Liu, G., & Tang, Y. (2023) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c01613 · Cited by 38
Identifying communities by influence dynamics in social networks
Stanoev, A., Smilkov, D., & Kocarev, L. (2011) · Physical Review E · doi:10.1103/physreve.84.046102 · Cited by 39
“Very often these networks exhibit modular and hierarchical structure that supports their evolution into a highly complex systems [5–7].”
BackgroundTaxonomy Induction Using Hierarchical Random Graphs
Fountain, T., & Lapata, M. (2012) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 37
A balanced modularity maximization link prediction model in social networks
Wu, J., Zhang, G., & Ren, Y. (2016) · Information Processing & Management · doi:10.1016/j.ipm.2016.10.001 · Cited by 38
“Clauset, Moore, and Newman (2008) presented a general technique to infer network hierarchical structure, and showed that hierarchical knowledge can be used to predict missing links with high accuracy.”
BackgroundGraph-Based Wrong IsA Relation Detection in a Large-Scale Lexical Taxonomy
Liang, J., Xiao, Y., Zhang, Y., Hwang, S.-W., & Wang, H. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10676 · Cited by 37
“One such example is studying hierarchy in social network (Clauset, Moore, and Newman 2008; Gupte et al. 2011; Henderson et al. 2012; Maiya and Berger-Wolf 2009).”
Mo, S., Chen, W., & Lu, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3182036 · Cited by 37
“On the other hand, many real-world MASs have a hierarchical organizational structure [31]–[33].”
BackgroundAverage distance in a hierarchical scale-free network: an exact solution
Zhang, Z., Lin, Y., Gao, S., Zhou, S., & Guan, J. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/10/p10022 · Cited by 38
Structural Preferential Attachment: Network Organization beyond the Link
Hébert‐Dufresne, L., Allard, A., Marceau, V., Noël, P., & Dubé, L. J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.158702 · Cited by 43
Adaptive degree penalization for link prediction
Martínez, V., Berzal, F., & Cubero, J.-C. (2015) · Journal of Computational Science · doi:10.1016/j.jocs.2015.12.003 · Cited by 37
On defining and computing communities
Olsen, M. (2012) · Cited by 37
Zhu, M., Zhou, X., Zhang, H., Wang, L., & Sun, H. (2023) · Resources Policy · doi:10.1016/j.resourpol.2023.103542 · Cited by 36
The effects of measurement error in case of scientific network analysis
Erman, N., & Todorovski, L. (2015) · Scientometrics · doi:10.1007/s11192-015-1615-5 · Cited by 36
“Clauset et al. (2008) apply hierarchical decomposition methods to identify patterns of existing connections between the vertices and then use the patterns for predicting the probability of connections between all pairs of network vertices.”
MethodTrait-mediated interaction leads to structural emergence in mutualistic networks
Minoarivelo, H. O., & Hui, C. (2015) · Evolutionary Ecology · doi:10.1007/s10682-015-9798-z · Cited by 36
An Activation Force-based Affinity Measure for Analyzing Complex Networks
Guo, J. H., Guo, H., & Wang, Z. (2011) · Scientific Reports · doi:10.1038/srep00113 · Cited by 36
“Combined with the algorithms that are used to detect community structure in networks 12 , these schemes have been shown to be effective.”
MethodMulti-Scale Clustering by Building a Robust and Self Correcting Ultrametric Topology on Data Points
Hsieh, F., Wang, H., VanderWaal, K. L., McCowan, B., & Koehl, P. (2013) · PLoS ONE · doi:10.1371/journal.pone.0056259 · Cited by 36
“This is partly the reason that the studies of complex networks, and in particular the identification of community structures within these networks have become a primary focus of research in many fields [1,2].”
BackgroundA utility-based link prediction method in social networks
Li, Y., Luo, P., Fan, Z., Chen, K., & Liu, J. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.12.041 · Cited by 36
3-HBP: A Three-Level Hidden Bayesian Link Prediction Model in Social Networks
Xiao, Y., Li, X., Wang, H., Xu, M., & Liu, Y. (2018) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2018.2812721 · Cited by 36
“For example, a user relationship recommendation system [27], a hierarchical model [28], and an SAN model [4] can be viewed as effective link prediction methods.”
Detecting and Assessing Anomalous Evolutionary Behaviors of Nodes in Evolving Social Networks
Wang, H., Wu, J. X., Hu, W., & Wu, X. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3299886 · Cited by 36
“We also consider three likelihood methods as follows: the hierarchical structure model ( HSM ) (Clauset et al. 2008), the stochastic block model ( SBM ) (Guimerà and Sales-Pardo 2010), and the loop model ( LM ) (Pan et al. 2016).”
MethodAdding community and dynamic to topic models
Li, D., Ding, Y., Shuai, X., Bollen, J., Tang, J., Chen, S., Zhu, J., & Rocha, G. V. (2012) · Journal of Informetrics · doi:10.1016/j.joi.2011.11.004 · Cited by 42
Super-Resolution Community Detection for Layer-Aggregated Multilayer Networks
Taylor, D., Caceres, R. S., & Mucha, P. J. (2017) · Physical Review X · doi:10.1103/physrevx.7.031056 · Cited by 40
Liu, C., & Zhou, W. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.06.034 · Cited by 35
A Network-based Approach for Predicting Missing Pathway Interactions
Navlakha, S., Gitter, A., & Bar‐Joseph, Z. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002640 · Cited by 40
“Network-only approaches range from completing defective cliques [33] to analyses based on the shared topology or the distance between two candidate proteins [34,35] to embeddings of the network to find non-interacting but adjacent proteins in the new space [36,37].”
Background
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.