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 801–900 of 1,000
Using connectomics for predictive assessment of brain parcellations
Albers, K. J., Ambrosen, K. S., Liptrot, M. G., Dyrby, T. B., Schmidt, M. N., & Mørup, M. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.118170 · Cited by 18
Paredes, R., Rato, T. J., & Reis, M. S. (2022) · Chemical Engineering Science · doi:10.1016/j.ces.2022.118338 · Cited by 17
Land‐use intensity influences European tetrapod food webs
Botella, C., Gaüzère, P., O’Connor, L. M. J., Ohlmann, M., Renaud, J., Dou, Y., Graham, C. H., Verburg, P. H., Maiorano, L., & Thuiller, W. (2024) · Global Change Biology · doi:10.1111/gcb.17167 · Cited by 21
Probase+: Inferring Missing Links in Conceptual Taxonomies
Liang, J., Xiao, Y., Wang, H., Zhang, Y., & Wang, W. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2653115 · Cited by 22
“similarity evaluation [15], [16], [17], [39], [40].”
BackgroundResolution of ranking hierarchies in directed networks
Letizia, E., Barucca, P., & Lillo, F. (2018) · PLoS ONE · doi:10.1371/journal.pone.0191604 · Cited by 17
“le social organisations, as command structure or influential communities. This concept is therefore very different from the more common definition of nested hierarchy in networks, studied for example in [3, 4, 20, 25], where low-level communities of nodes are nested into bigger ones, in a way directly associated with hie…”
Zhang, Y., Wang, Z., & Wang, Y. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbv112 · Cited by 18
Measuring the hierarchy of feedforward networks
Corominas-Murtra, B., Rodríguez-Caso, C., Goñi, J., & Solé, R. (2011) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3562548 · Cited by 16
“One outcome of these efforts has been a number of powerful, heuristic measures [3, 17, 23, 25, 29, 31].”
BackgroundZhang, X., & Butts, C. T. (2017) · Social Network Analysis and Mining · doi:10.1007/s13278-016-0419-9 · Cited by 16
“(HRG) model (Clauset et al. 2008); we then compare the structure inferred by the HRG with that resulting from a”
MethodResultLearning software requirements syntax: An unsupervised approach to recognize templates
Sonbol, R., Rebdawi, G., & Ghneim, N. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108933 · Cited by 16
Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search
Chu, D., Zhang, F., Zhang, W., Lin, X., & Zhang, Y. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00090 · Cited by 16
“HCD is a fundamental concept in network analysis, which is effective to locate cohesive subgraphs and can lead to a better understanding of some network phenomena [9].”
BackgroundEarly identification of breakthrough technologies: Insights from science-driven innovations
Wang, D., Zhou, X., Zhao, P., Pang, J., & Ren, Q. (2024) · Journal of Informetrics · doi:10.1016/j.joi.2024.101606 · Cited by 16
Kim, E., Lee, D., Sakamoto, S., Jo, J., Vargas, M., Ishizaki, A., Minagawa, J., & Kim, H. (2025) · Science Advances · doi:10.1126/sciadv.ads0327 · Cited by 20
Community Structure and Interaction Locality in Social Networks
Tsugawa, S., & Ohsaki, H. (2015) · Journal of Information Processing · doi:10.2197/ipsjjip.23.402 · Cited by 17
A social network model driven by events and interests
Sun, X., Lin, H., & Xu, K. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.01.020 · Cited by 18
Savas, O., Sagduyu, Y. E., Deng, J., & Li, J. (2014) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2627534.2627561 · Cited by 16
Lourenço, P. M., Catry, T., Lopes, R. J., Piersma, T., & Granadeiro, J. P. (2016) · Marine Ecology Progress Series · doi:10.3354/meps11979 · Cited by 16
Extensions and applications of equitable decompositions for graphs with symmetries
Francis, A. E., Smith, D., Sorensen, D., & Webb, B. Z. (2017) · Linear Algebra and its Applications · doi:10.1016/j.laa.2017.06.045 · Cited by 16
“Third, there is often only partial or local information regarding the structure of many of these networks because of the complications in obtaining network data (see, for instance, [7]).”
BackgroundChordality Properties and Hyperbolicity on Graphs
Martínez-Pérez, Á. (2016) · The Electronic Journal of Combinatorics · doi:10.37236/5315 · Cited by 19
“Gromov hyperbolicity, specially in graphs, has found applications in different areas such as phylogenetics (see [15, 16]), complex networks (see [13, 24, 35, 36]) or the secure transmission of information and virus propagation on networks (see [22, 23]).”
BackgroundHyperbolic node embedding for signed networks
Song, W., Chen, H., Liu, X., Jiang, H., & Wang, S. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.10.008 · Cited by 22
“This result suggests that the hierarchy may be ubiquitous in many signed social networks because the scale-free property is the consequence of the underlying hierarchy [7, 8].”
BackgroundZhao, S., Kim, K. D., Wang, L., Ryoo, R., & Huang, J. (2020) · Advanced Materials Interfaces · doi:10.1002/admi.202001846 · Cited by 16
Collaborative filtering approach to link prediction
Lee, Y.-L., & Zhou, T. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126107 · Cited by 16
“The second one is the RA index [16] that is obtained by weakening the weights of large-degree common neighbors according to a resource-allocation dynamics [17], say Sxy RA = ∑ 1 kz z∈Γx∩Γy , (2)”
BackgroundMethodHOPLP − MUL: link prediction in multiplex networks based on higher order paths and layer fusion
Mishra, S., Singh, S. S., Kumar, A., & Biswas, B. (2022) · Applied Intelligence · doi:10.1007/s10489-022-03733-8 · Cited by 17
“Different methods have been proposed for link prediction that can be broadly classified as similarity-based [7], learning-based [8], probabilistic and maximum likelihood-based [9, 10], etc.”
MethodLink prediction via nonnegative matrix factorization enhanced by blocks information
Yang, Q., Dong, E., & Xie, Z. Y. (2014) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2014.6975944 · Cited by 16
“(3)Hierarchical Random Graphs(HRG) [3].”
BackgroundMethodLink prediction in weighted networks
Wind, D. K., & Mørup, M. (2012) · Machine learning for signal processing ... · doi:10.1109/mlsp.2012.6349745 · Cited by 20
“We attempt to determine the effect of considering edge-weights in complex networks, by varying the number of observed edges in networks, and then use the inferred structure to predict which edges were removed and set to zero (i.e., link-prediction).”
BackgroundLink prediction based on time-varied weight in co-authorship network
Huang, S., Tang, Y. Z., Tang, F., & Li, J. (2014) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd.2014.6846931 · Cited by 16
“For this reason, we use a standard metric AUC, area under the receiver operating characteristic (ROC) curve [6], to quantify the accuracy of prediction algorithms.”
MethodSpectral Regression with Low-Rank Approximation for Dynamic Graph Link Prediction
Fang, C. V., Ralescu, A., & Kohram, M. (2011) · IEEE Intelligent Systems · doi:10.1109/mis.2011.44 · Cited by 16
A Review of Link Prediction in Social Networks
Wang, T., & Liao, G. (2014) · International Conference on Management of e-Commerce and e-Government · doi:10.1109/icmecg.2014.38 · Cited by 16
A Network Structural Approach to the Link Prediction Problem
Lee, C., Pham, T. M., Jeong, M. K., Kim, D., Lin, D. K. J., & Chaovalitwongse, W. A. (2015) · INFORMS journal on computing · doi:10.1287/ijoc.2014.0624 · Cited by 16
Genome-wide discovery of missing genes in biological pathways of prokaryotes
Chen, Y., Mao, F., Li, G., & Xu, Y. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-s1-s1 · Cited by 16
“individual pathways and between pathways provide more insights about the hierarchical structure of pathways and consisted with earlier studies [24-26].”
ResultHigh-veracity functional imaging in scanning probe microscopy via Graph-Bootstrapping
Li, X., Collins, L. F., Miyazawa, K., Fukuma, T., Jesse, S., & Kalinin, S. V. (2018) · Nature Communications · doi:10.1038/s41467-018-04887-1 · Cited by 16
Time evolution of the hierarchical networks between PubMed MeSH terms
Balogh, S. G., Zagyva, D., Pollner, P., & Palla, G. (2019) · PLoS ONE · doi:10.1371/journal.pone.0220648 · Cited by 17
“A very important topic in this field is related to the hierarchical organization of networks [3, 4, 5, 6, 7].”
dK-Microaggregation: Anonymizing Graphs with Differential Privacy Guarantees
Iftikhar, M., Wang, Q., & Lin, Y. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-47436-2_15 · Cited by 16
“To address this issue, many approaches [19] [20] [21] [22] perturb various statistical information of a graph by projecting graph data into other domains using feature-abstraction models [2, 16] .”
BackgroundMethodLink Prediction through Deep Generative Model
Wang, X., Chen, Y., & Liu, Y. (2020) · iScience · doi:10.1016/j.isci.2020.101626 · Cited by 16
Kuang, J., & Scoglio, C. (2021) · Physical review. E · doi:10.1103/physreve.104.024301 · Cited by 18
Guns, R. (2014) · Springer eBooks · doi:10.1007/978-3-319-10377-8_2 · Cited by 16
Inference for Graphs and Networks: Adapting Classical Tools to Modern Data
Olding, B. P., & Wolfe, P. J. (2014) · IMPERIAL COLLEGE PRESS eBooks · doi:10.1142/9781783263752_0001 · Cited by 21
“Indeed, careful reflection often reveals that zero entries in relational data sets are often better thought of as unobserved (Clauset et al., 2008; Marchette and Priebe, 2008). The implications of this fact for subsequent analysis procedures—as well as on approximate likelihood maximization procedures and spectral met…”
BackgroundSubstance graphs are optimal simple-graph representations of metabolism
Holme, P., & Huss, M. (2010) · Chinese Science Bulletin · doi:10.1007/s11434-010-4086-3 · Cited by 18
Emerging topics in Internet technology: A complex networks approach
Khan, B. S., & Niazi, M. A. (2018) · Internet Technology Letters · doi:10.1002/itl2.41 · Cited by 16
Benchmarking Graph Neural Networks on Link PredictionPreprint
Wang, X., & Vinel, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.12557 · Cited by 23
“There are also probabilistic approaches assuming a known prior structure of the graph, such as hierarchical or circles structures [1], though the accuracy was not satisfactory.”
Fang, Y., Sun, M., Dai, G., & Ramain, K. (2015) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2456876 · Cited by 16
Tag-Based Navigation and Visualization
Dimitrov, D., Helić, D., & Strohmaier, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-90092-6_6 · Cited by 16
Private Hierarchical Clustering in Federated Networks
Kolluri, A., Baluta, T., & Saxena, P. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484822 · Cited by 15
“The convergence criteria used by the prior works, for their MCMC algorithms [14, 89], heuristically compares the average quality of sampled HCTs over an interval of 65536 iterations to the average in the previous interval.”
BackgroundMethodInfluentialPrivacy-Preserving Link Prediction in Multiple Private Networks
Zhang, H., Ma, X., Wang, J., Zhang, X., Pan, D., & Zhong, K. (2022) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2022.3168010 · Cited by 15
“Therefore, various link prediction approaches have been proposed to predict missing links in the networks, such as similarity-based approaches [7], [8], maximum likelihood approaches [9], [10], and probabilistic models [11], [12].”
BackgroundDeep-learning reconstruction of complex dynamical networks from incomplete data
Ding, X. H., Kong, L.-W., Zhang, H., & Lai, Y. (2024) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0201557 · Cited by 18
Analysis of multiple physical parameters for mechanical phenotyping of living cells
Kießling, T. R., Herrera, M., Nnetu, K. D., Balzer, E. M., Girvan, M., Fritsch, A. W., Martin, S. S., Käs, J. A., & Losert, W. (2013) · European Biophysics Journal · doi:10.1007/s00249-013-0888-y · Cited by 15
Collective Graph Identification
Namata, G. M. S., London, B., & Getoor, L. C. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2818378 · Cited by 18
“Topology-based approaches[Liben-Nowell and Kleinberg 2003; Yu et al. 2006; Clauset et al. 2008] typically rely on some notion of structural proximity, where nodes which are close are likely to share an edge (e.”
BackgroundNetwork analysis of coal mine hazards based on text mining and link prediction
Wang, Z., Li, H., & Tang, R. (2019) · International Journal of Modern Physics C · doi:10.1142/s0129183119400096 · Cited by 15
Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models
Yu, T., & De, C. (2019) · neural information processing systems · Cited by 15
Link prediction in the Granger causality network of the global currency market
Park, J. H., Chang, W., & Song, J. W. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124668 · Cited by 17
Randhawa, V., & Pathania, S. (2020) · Briefings in Functional Genomics · doi:10.1093/bfgp/elaa015 · Cited by 17
On finite mixture modeling and model-based clustering of directed weighted multilayer networks
Melnykov, V., Sarkar, S., & Melnykov, Y. (2020) · Pattern Recognition · doi:10.1016/j.patcog.2020.107641 · Cited by 17
Zhang, Q., Ma, J., Yang, Y., Luo, Z., Wang, Y., & Chen, F. (2021) · Frontiers in Environmental Science · doi:10.3389/fenvs.2021.656708 · Cited by 15
Culture, Mind, and Brain: Emerging Concepts, Models, and Applications
Kirmayer, L. J., Worthman, C. M., Kitayama, S., Lemelson, R., & Cummings, C. A. (2020) · Cited by 47
MMiKG: a knowledge graph-based platform for path mining of microbiota–mental diseases interactions
Sun, H., Song, Z., Chen, Q., Wang, M., Tang, F., Dou, L., Zou, Q., & Yang, F. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad340 · Cited by 17
Consistency between functional and structural networks of coupled nonlinear oscillators
Lin, W. V., Wang, Y., Ying, H.-P., Lai, Y., & Wang, X. (2015) · Physical Review E · doi:10.1103/physreve.92.012912 · Cited by 16
Degree-corrected stochastic block models and reliability in networks
Zhang, X., Wang, X., Zhao, C., Yi, D., & Xie, Z. Y. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.08.061 · Cited by 20
Reconstructing complex networks without time series
Ma, C., Zhang, H.-F., & Lai, Y. (2017) · Physical review. E · doi:10.1103/physreve.96.022320 · Cited by 21
Sapienza, A., Barrat, A., Cattuto, C., & Gauvin, L. (2018) · Physical review. E · doi:10.1103/physreve.98.012317 · Cited by 17
Bayesian Inference of Network Structure From Information Cascades
Gray, C., Mitchell, L., & Roughan, M. (2020) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2020.2990276 · Cited by 23
“We begin with the canonical Erdős-Rényi (ER) networks and then extend to more realistic networks with power-law distributions using the forest fire model [29] and core-periphery and hierarchical structures [8] using Kronecker networks [28].”
MethodHurdle Blockmodels for Sparse Network Modeling
Motalebi, N., Stevens, N. T., & Steiner, S. H. (2021) · The American Statistician · doi:10.1080/00031305.2020.1865199 · Cited by 15
“…1981; Wasser-man and Pattison 1996; Pattison and Wasserman 1999; Snijders et al. 2006), hierarchical random graphs (Clauset, Moore, and Newman 2006, 2008), the latent space model (Hoff, Raftery, and Handcock 2002), the hierarchical latent space model (Wilson, Cranmer, and Lu 2020) and stochastic…”
BackgroundGeneralized linear models with low rank effects for network dataPreprint
Wu, Y.-J., Levina, E., & Zhu, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.06772 · Cited by 18
“Assumptions other than homophily have also been considered, such as hierarchical network structure (Clauset et al., 2008), structural equivalence (Hoff, 2007).”
BackgroundToward Structural Controllability and Predictability in Directed Networks
Jing, F., Liu, C., Wu, J., & Zhang, Z. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3161408 · Cited by 15
Reis, M., & Saraiva, P. (2022) · Computers and Chemical Engineering · doi:10.1016/j.compchemeng.2022.107675 · Cited by 13
Deep non-negative matrix factorization with edge generator for link prediction in complex networks
Yao, Y., He, Y., Huang, Z., Xu, Z., Yang, F., Tang, J., & Gao, K. (2023) · Applied Intelligence · doi:10.1007/s10489-023-05211-1 · Cited by 14
Link prediction using deep autoencoder-like non-negative matrix factorization with L21-norm
Li, T., Zhang, R., Yao, Y., Liu, Y., & Ma, J. (2024) · Applied Intelligence · doi:10.1007/s10489-024-05365-6 · Cited by 15
“In contrast to the aforementioned methods, Clauset et al. [16] proposed a probabilistic model that leverages the hierarchical organization of real-world networks to compute pairwise similarity scores between nodes.”
Puello-Polo, E., Checca‐Huaman, N., Toloza, C. A. T., Santolalla-Vargas, C. E., Díaz, Y., Fals, J., Mendoza, C. D., Figueroa, N. S., Márquez, E., Arrieta, A. R. A., et al. (2024) · Industrial & Engineering Chemistry Research · doi:10.1021/acs.iecr.3c03242 · Cited by 14
Enhancing link prediction through adversarial training in deep Nonnegative Matrix Factorization
Mahmoodi, R., Seyedi, S. A., Abdollahpouri, A., & Tab, F. A. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.108641 · Cited by 14
Network link prediction via deep learning method: A comparative analysis with traditional methods
Zare, G., Navimipour, N. J., Hosseinzadeh, M., & Sahafi, A. (2024) · Engineering Science and Technology an International Journal · doi:10.1016/j.jestch.2024.101782 · Cited by 25
Communication network dynamics in a large organizational hierarchy
Josephs, N., Peng, S., & Crawford, F. W. (2024) · The Annals of Applied Statistics · doi:10.1214/24-aoas1919 · Cited by 14
Qiao, Y., Zhang, S., & Chen, L. (2025) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2025.3543354 · Cited by 16
Reis, M. S. (2013) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2013.05.007 · Cited by 14
Detecting hierarchical structure in networks
Herlau, T., Mørup, M., Schmidt, M. N., & Hansen, L. K. (2012) · International Workshop on Cognitive Information Processing (CIP) · doi:10.1109/cip.2012.6232913 · Cited by 17
“Based on the framework above, we formulate a generative model of hierarchical network structure, that contains the models of Clauset et al. [14], [19] and Kemp et al. [17] as special cases.”
BackgroundMethodInfluentialLink Prediction in Networks with Core-Fringe Data
Benson, A. R., & Kleinberg, J. M. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313626 · Cited by 15
Ida, R., Gunawan, E., Widiyantoro, S., Sunarti, E., Marliyani, G. I., & Maulidiyah, L. (2022) · Geomatics Natural Hazards and Risk · doi:10.1080/19475705.2022.2033854 · Cited by 14
“…structure from network data, which often show that existence of hierarchy can explain simultaneously and quantitatively reproduced ‘topological properties’ of networks such as “right-skewed degree distributions, high clustering coefficients, and shortpath length” (Clauset et al. 2008, p. 98).”
BackgroundNonlinear Structural Equation Model Guided Gaussian Mixture Hierarchical Topic Modeling
Chen, H., Mao, P., Lu, Y., & Rao, Y. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-long.578 · Cited by 14
“For example, in the case of modules in biochemical networks or communities in social networks, information cross-talk between nodes at the same level plays a crucial role in the extraction of higher level abstraction modules (Clauset et al., 2008).”
BackgroundPredicting Positive and Negative Relationships in Large Social Networks
Wang, G., Gao, H., Chen, L., Mensah, D. N. A., & Fu, Y. (2015) · PLoS ONE · doi:10.1371/journal.pone.0129530 · Cited by 15
Graph learning and its advancements on large language models: A holistic survey
Wei, S., Wang, J., Zhao, Y., Chen, X., Hu, X., Li, Q., Zhuang, F., Ren, F., & Kou, G. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.132396 · Cited by 19
“Clauset et al. [117] introduce a methodology leveraging network data to infer hierarchies within networks, replicating the topological properties and predicting missing links based on the properties of network hierarchies.”
Learning in Hierarchical Social Networks
Zhang, Z., Chong, E. K. P., Pezeshki, A., Moran, B., & Howard, S. D. (2013) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2013.2245859 · Cited by 15
Supervised-learning link recommendation in the DBLP co-authoring network
Gimenes, G. P., Gualdron, H., Raddo, T. R., & Junior, J. F. R. (2014) · IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) · doi:10.1109/percomw.2014.6815268 · Cited by 14
HiNO: An Approach for Inferring Hierarchical Organization from Regulatory Networks
Hartsperger, M. L., Strache, R., & Stümpflen, V. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013698 · Cited by 15
“The direct implication is a hierarchical organization, where a higher-level structure results from multiple instances of lower-level structure of different types [5].”
BackgroundEvaluating Word Sense Induction and Disambiguation Methods
Klapaftis, I. P., & Manandhar, S. (2013) · Language Resources and Evaluation · doi:10.1007/s10579-012-9205-0 · Cited by 16
“The method of Hierarchical Random Graphs (Clauset et al. 2008) is then applied, in order to infer the hierarchical structure (binary tree) of the constructed graph.”
MethodAccurate similarity index based on the contributions of paths and end nodes for link prediction
Li, L., Qian, L., Cheng, J., Ma, M., & Chen, X. (2014) · Journal of Information Science · doi:10.1177/0165551514560121 · Cited by 14
“Instead of blindly checking all possible interactions, predicting based on the observed structural contexts and focusing on most likely existent links can sharply reduce the experimental costs if the prediction method is accurate enough [5].”
BackgroundComputational method for the point cluster analysis on networks
Sugihara, K., Okabe, A., & Satoh, T. (2009) · GeoInformatica · doi:10.1007/s10707-009-0092-5 · Cited by 14
“The method by Clauset et al. [ 3 ] cannot be applied to our problem because their networks are just graphs in the sense that all the edges have the same unit length.”
MethodCommunity detection in online social networks using actions of users
Moosavi, S. A., & Jalali, M. (2014) · Iranian Conference on Intelligent Systems (ICIS) · doi:10.1109/iraniancis.2014.6802552 · Cited by 14
“To solve this challenging issue, researchers in other projects propose methods which are based on a Bayesian probability model [31] [32] [33].”
MethodOverlapping Modularity at the Critical Point of k-Clique Percolation
Tóth, B., Vicsek, T., & Palla, G. (2012) · Journal of Statistical Physics · doi:10.1007/s10955-012-0640-5 · Cited by 15
Mid size cliques are more common in real world networks than triangles
Slater, N., ITZCHACK, R., & Louzoun, Y. (2014) · Network Science · doi:10.1017/nws.2014.22 · Cited by 16
“The structure of real world networks has become the subject of great interest in recent years (Clauset et al., 2008; Milo et al., 2002; M. E. J. Newman, 2003; Ravasz & Barab´asi, 2003).”
BackgroundEvaluating Link Prediction on Large Graphs
García-Gasulla, D., Cortés, U., Eduard, A., & Labarta, J. (2015) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-578-4-90 · Cited by 20
“Most research on LP use ROC curves[22,7,4,21] or PR curves [23,1] for evaluation, but for the reasons discussed in §2.”
MethodNotice of Removal March 3, 2026: Inferring Dynamic Diffusion Networks in Online Media
Tahani, M., Hemmatyar, A. M. A., Rabiee, H. R., & Ramezani, M. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2882968 · Cited by 14
“(1) Synthetic Networks : We used the Forest-Fire model [Leskovec et al. 2005] and two types of the Kronecker graph model [Leskovec and Faloutsos 2007] (the Hierarchical [Clauset et al. 2008] and the Core-Periphery network [Leskovec et al. 2008]) in order to construct synthetic networks.”
MethodNetwork Growth and Link Prediction Through an Empirical Lens
Liu, Q., Tang, S., Zhang, X., Zhao, X., Zhao, B. Y., & Zheng, H.-T. (2016) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2987443.2987452 · Cited by 14
“We now describe the datasets used for our study and our experimental methodology.”
BackgroundMethodThe structure of communities in scale‐free networks
Jiang, J., Wen, S., Yu, S., Xiang, Y., Zhou, W., & Hassan, H. (2016) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4040 · Cited by 16
“Assortativity assesses the tendency of nodes with similar degree to connect with each other in networks [6, 13].”
BackgroundBeyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
Schoenebeck, G. R., & Tao, B. (2019) · ACM Transactions on Computation Theory · doi:10.1145/3313904 · Cited by 19
Social Network Community Detection Using Agglomerative Spectral Clustering
Narantsatsralt, U.-U., & Kang, S. (2017) · Complexity · doi:10.1155/2017/3719428 · Cited by 14
“Hierarchical clustering is used for complex networks because they often have a hierarchical structure [14].”
MethodMind-Personality Relations from Childhood to Early Adulthood
Δημητρίου, Α., Spanoudis, G. C., Žebec, M. S., Ανδρέου, Μ., Golino, H. F., & Kazi, S. (2018) · Journal of Intelligence · doi:10.3390/jintelligence6040051 · Cited by 16
“Hierarchical random graphs were developed by Clauset, Moore, and Newman [69] as a probabilistic technique to detect hierarchies in network structures.”
MethodTaha, K. (2020) · IEEE Access · doi:10.1109/access.2020.2996595 · Cited by 14
“Initially, the search starts from some hierarchy (e.g., a vertex), which is considered as a separate community [17].”
BackgroundInference of edge correlations in multilayer networks
Pamfil, A. R., Howison, S., & Porter, M. A. (2020) · Physical review. E · doi:10.1103/physreve.102.062307 · Cited by 19
An information theoretic approach to link prediction in multiplex networks
Jafari, S. H., Abdolhosseini-Qomi, A. M., Asadpour, M., Rahgozar, M., & Yazdani, N. (2021) · Scientific Reports · doi:10.1038/s41598-021-92427-1 · Cited by 16
A Game Theory Based Approach for Community Detection in Social Networks
Zhou, L., Lü, K., Cheng, C., & Chen, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39467-6_24 · Cited by 14
Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets
Park, I. H., Lee, K. H., & Lee, D. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq207 · Cited by 15
Multi-scale Modularity and Dynamics in Complex Networks
Lambiotte, R. (2013) · Modeling and simulation in science, engineering & technology · doi:10.1007/978-1-4614-6729-8_7 · Cited by 17
Faster way to agony: Discovering hierarchies in directed graphsPreprint
Tatti, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.01477 · Cited by 14
“Many real-world phenomena exhibit strong hierarchical structure [2, 5, 9, 10, 11].”
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.