{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:11:07Z","timestamp":1777288267085,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NExTWORKx"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multiple network embedding algorithms have been proposed to perform the prediction of missing or future links in complex networks. However, we lack the understanding of how network topology affects their performance, or which algorithms are more likely to perform better given the topological properties of the network. In this paper, we investigate how the clustering coefficient of a network, i.e., the probability that the neighbours of a node are also connected, affects network embedding algorithms\u2019 performance in link prediction, in terms of the AUC (area under the ROC curve). We evaluate classic embedding algorithms, i.e., Matrix Factorisation, Laplacian Eigenmaps and node2vec, in both synthetic networks and (rewired) real-world networks with variable clustering coefficient. Specifically, a rewiring algorithm is applied to each real-world network to change the clustering coefficient while keeping key network properties. We find that a higher clustering coefficient tends to lead to a higher AUC in link prediction, except for Matrix Factorisation, which is not sensitive to the change of clustering coefficient. To understand such influence of the clustering coefficient, we (1) explore the relation between the link rating (probability that a node pair is the missing link) derived from the aforementioned algorithms and the number of common neighbours of the node pair, and (2) evaluate these embedding algorithms\u2019 ability to reconstruct the original training (sub)network. All the network embedding algorithms that we tested tend to assign higher likelihood of connection to node pairs that share an intermediate or high number of common neighbours, independently of the clustering coefficient of the training network. Then, the predicted networks will have more triangles, thus a higher clustering coefficient. As the clustering coefficient increases, all the algorithms but Matrix Factorisation could also better reconstruct the training network. These two observations may partially explain why increasing the clustering coefficient improves the prediction performance.<\/jats:p>","DOI":"10.1007\/s41109-022-00471-1","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T11:25:32Z","timestamp":1654255532000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Influence of clustering coefficient on network embedding in link prediction"],"prefix":"10.1007","volume":"7","author":[{"given":"Omar F.","family":"Robledo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiu-Xiu","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Hanjalic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2684-4407","authenticated-orcid":false,"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"key":"471_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47\u201397. https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev Mod Phys"},{"issue":"4","key":"471_CR2","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1093\/comnet\/cny032","volume":"7","author":"J Alstott","year":"2018","unstructured":"Alstott J, Klymko C, Pyzza PB, Radcliffe M (2018) Local rewiring algorithms to increase clustering and grow a small world. J Complex Netw 7(4):564\u2013584. https:\/\/doi.org\/10.1093\/comnet\/cny032","journal-title":"J Complex Netw"},{"issue":"19","key":"471_CR3","doi-asserted-by":"publisher","first-page":"7310","DOI":"10.1126\/sciadv.aax7310","volume":"6","author":"A Asikainen","year":"2020","unstructured":"Asikainen A, I\u00f1iguez G, Ure\u00f1a-Carri\u00f3n J, Kaski K, Kivel\u00e4 M (2020) Cumulative effects of triadic closure and homophily in social networks. Sci Adv 6(19):7310. https:\/\/doi.org\/10.1126\/sciadv.aax7310","journal-title":"Sci Adv"},{"issue":"5439","key":"471_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"471_CR5","doi-asserted-by":"publisher","unstructured":"Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic. NIPS\u201901. MIT Press, Cambridge, pp 585\u2013591. https:\/\/doi.org\/10.7551\/mitpress\/1120.003.0080","DOI":"10.7551\/mitpress\/1120.003.0080"},{"issue":"8","key":"471_CR6","doi-asserted-by":"publisher","first-page":"9815","DOI":"10.1126\/sciadv.aap9815","volume":"4","author":"EE Bruch","year":"2018","unstructured":"Bruch EE, Newman MEJ (2018) Aspirational pursuit of mates in online dating markets. Sci Adv 4(8):9815. https:\/\/doi.org\/10.1126\/sciadv.aap9815","journal-title":"Sci Adv"},{"key":"471_CR7","doi-asserted-by":"publisher","DOI":"10.1063\/1.5120724","author":"R-M Cao","year":"2019","unstructured":"Cao R-M, Liu S-Y, Xu X-K (2019) Network embedding for link prediction: the pitfall and improvement. Chaos (Woodbury, NY). https:\/\/doi.org\/10.1063\/1.5120724","journal-title":"Chaos (Woodbury, N.Y.)"},{"issue":"5","key":"471_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2019","unstructured":"Cui P, Wang X, Pei J, Zhu W (2019) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852. https:\/\/doi.org\/10.1109\/TKDE.2018.2849727","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"471_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"CL da Fontoura","year":"2011","unstructured":"da Fontoura CL, Travieso G, Rodrigues FA, Boas PRV, Antiqueira L, Viana MP, Rocha LEC (2011) Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adva Phys 60(3):329\u2013412. https:\/\/doi.org\/10.1080\/00018732.2011.572452","journal-title":"Adva Phys"},{"key":"471_CR10","doi-asserted-by":"publisher","unstructured":"Epasto A, Perozzi B (2019) Is a single embedding enough? learning node representations that capture multiple social contexts. In: The world wide web conference. WWW \u201919. Association for Computing Machinery, New York, pp 394\u2013404. https:\/\/doi.org\/10.1145\/3308558.3313660","DOI":"10.1145\/3308558.3313660"},{"issue":"1","key":"471_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1140\/epjb\/e2011-20207-x","volume":"85","author":"X Feng","year":"2012","unstructured":"Feng X, Zhao JC, Xu K (2012) Link prediction in complex networks: a clustering perspective. Eur Phys J B 85(1):3. https:\/\/doi.org\/10.1140\/epjb\/e2011-20207-x","journal-title":"Eur Phys J B"},{"issue":"3","key":"471_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174. https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys Rep"},{"key":"471_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066117","volume":"84","author":"DV Foster","year":"2011","unstructured":"Foster DV, Foster JG, Grassberger P, Paczuski M (2011) Clustering drives assortativity and community structure in ensembles of networks. Phys Rev E 84:066117. https:\/\/doi.org\/10.1103\/PhysRevE.84.066117","journal-title":"Phys Rev E"},{"issue":"12","key":"471_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc Natl Acad Sci"},{"key":"471_CR15","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) Node2Vec: scalable feature learning for networks. In: Proceedings of the 22Nd ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201916. ACM, New York, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"1","key":"471_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143(1):29\u201336. https:\/\/doi.org\/10.1148\/radiology.143.1.7063747 (PMID: 7063747)","journal-title":"Radiology"},{"issue":"1","key":"471_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inf Syst 22(1):5\u201353. https:\/\/doi.org\/10.1145\/963770.963772","journal-title":"ACM Trans Inf Syst"},{"issue":"5","key":"471_CR18","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1109\/TKDE.2019.2951398","volume":"33","author":"M Khosla","year":"2021","unstructured":"Khosla M, Setty V, Anand A (2021) A comparative study for unsupervised network representation learning. IEEE Trans Knowl Data Eng 33(5):1807\u20131818. https:\/\/doi.org\/10.1109\/TKDE.2019.2951398","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"471_CR19","doi-asserted-by":"publisher","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201908. Association for Computing Machinery, New York, pp 426\u2013434. https:\/\/doi.org\/10.1145\/1401890.1401944","DOI":"10.1145\/1401890.1401944"},{"issue":"8","key":"471_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337. https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"471_CR21","doi-asserted-by":"publisher","unstructured":"Kotu V, Deshpande B (2019) Chapter 11\u2014Recommendation engines. In: Kotu V, Deshpande B (eds) Data science, 2nd edn. Morgan Kaufmann, Cambridge, pp. 343\u2013394. https:\/\/doi.org\/10.1016\/B978-0-12-814761-0.00011-3","DOI":"10.1016\/B978-0-12-814761-0.00011-3"},{"issue":"1","key":"471_CR22","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1038\/s41467-019-09177-y","volume":"10","author":"IA Kov\u00e1cs","year":"2019","unstructured":"Kov\u00e1cs IA, Luck K, Spirohn K, Wang Y, Pollis C, Schlabach S, Bian W, Kim D-K, Kishore N, Hao T, Calderwood MA, Vidal M, Barab\u00e1si A-L (2019) Network-based prediction of protein interactions. Nat Commun 10(1):1240. https:\/\/doi.org\/10.1038\/s41467-019-09177-y","journal-title":"Nat Commun"},{"key":"471_CR23","doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) KONECT: the Koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web. WWW \u201913 Companion. Association for Computing Machinery, New York, pp 1343\u20131350. https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"issue":"11","key":"471_CR24","doi-asserted-by":"publisher","first-page":"11018","DOI":"10.1088\/1742-5468\/2011\/11\/p11018","volume":"2011","author":"C Li","year":"2011","unstructured":"Li C, Wang H, de Haan W, Stam CJ, Mieghem PV (2011) The correlation of metrics in complex networks with applications in functional brain networks. J Stat Mech Theory Exp 2011(11):11018. https:\/\/doi.org\/10.1088\/1742-5468\/2011\/11\/p11018","journal-title":"J Stat Mech Theory Exp"},{"key":"471_CR25","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.physa.2015.05.009","volume":"436","author":"H Liao","year":"2015","unstructured":"Liao H, Zeng A, Zhang Y-C (2015) Predicting missing links via correlation between nodes. Physica A 436:216\u2013223. https:\/\/doi.org\/10.1016\/j.physa.2015.05.009","journal-title":"Physica A"},{"key":"471_CR26","doi-asserted-by":"publisher","unstructured":"Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings of the twelfth international conference on information and knowledge management. CIKM \u201903. Association for Computing Machinery, New York, pp 556\u2013559. https:\/\/doi.org\/10.1145\/956863.956972","DOI":"10.1145\/956863.956972"},{"key":"471_CR27","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.physa.2017.12.026","volume":"496","author":"L Liu","year":"2018","unstructured":"Liu L, Qu B, Chen B, Hanjalic A, Wang H (2018) Modelling of information diffusion on social networks with applications to wechat. Physica A 496:318\u2013329. https:\/\/doi.org\/10.1016\/j.physa.2017.12.026","journal-title":"Physica A"},{"issue":"6","key":"471_CR28","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Physica A 390(6):1150\u20131170. https:\/\/doi.org\/10.1016\/j.physa.2010.11.027","journal-title":"Physica A"},{"key":"471_CR29","doi-asserted-by":"publisher","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford. https:\/\/doi.org\/10.1080\/0022250X.2012.744247","DOI":"10.1080\/0022250X.2012.744247"},{"key":"471_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256. https:\/\/doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev"},{"key":"471_CR31","doi-asserted-by":"publisher","unstructured":"Orman K, Labatut V, Cherifi H (2013) In: Menezes R, Evsukoff A, Gonz\u00e1lez MC (eds) An empirical study of the relation between community structure and transitivity. Springer, Berlin, pp 99\u2013110. https:\/\/doi.org\/10.1007\/978-3-642-30287-9_11","DOI":"10.1007\/978-3-642-30287-9_11"},{"key":"471_CR32","doi-asserted-by":"publisher","unstructured":"Ostroumova L, Ryabchenko A, Samosvat E (2013) Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient. In: Bonato A, Mitzenmacher M, Pra\u0142at P (eds) Algorithms and models for the web graph. Springer, Cham, pp 185\u2013202. https:\/\/doi.org\/10.1007\/978-3-319-03536-9_15","DOI":"10.1007\/978-3-319-03536-9_15"},{"key":"471_CR33","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1103\/RevModPhys.87.925","volume":"87","author":"R Pastor-Satorras","year":"2015","unstructured":"Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87:925\u2013979. https:\/\/doi.org\/10.1103\/RevModPhys.87.925","journal-title":"Rev Mod Phys"},{"key":"471_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.12.011004","volume":"12","author":"TP Peixoto","year":"2022","unstructured":"Peixoto TP (2022) Disentangling homophily, community structure, and triadic closure in networks. Phys Rev X 12:011004. https:\/\/doi.org\/10.1103\/PhysRevX.12.011004","journal-title":"Phys Rev X"},{"key":"471_CR35","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201914. Association for Computing Machinery, New York, pp 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"471_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/65943.65945","volume":"7","author":"V Raghavan","year":"1989","unstructured":"Raghavan V, Jung G, Bollmann P (1989) A critical investigation of recall and precision as measures of retrieval system performance. ACM Trans Inf Syst 7:205\u2013229. https:\/\/doi.org\/10.1145\/65943.65945","journal-title":"ACM Trans Inf Syst"},{"issue":"7062","key":"471_CR37","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1038\/nature04209","volume":"437","author":"J-F Rual","year":"2005","unstructured":"Rual J-F, Venkatesan K, Hao T, Hirozane-Kishikawa T, Dricot A, Li N, Berriz GF, Gibbons FD, Dreze M, Ayivi-Guedehoussou N, Klitgord N, Simon C, Boxem M, Milstein S, Rosenberg J, Goldberg DS, Zhang LV, Wong SL, Franklin G, Li S, Albala JS, Lim J, Fraughton C, Llamosas E, Cevik S, Bex C, Lamesch P, Sikorski RS, Vandenhaute J, Zoghbi HY, Smolyar A, Bosak S, Sequerra R, Doucette-Stamm L, Cusick ME, Hill DE, Roth FP, Vidal M (2005) Towards a proteome-scale map of the human protein\u2013protein interaction network. Nature 437(7062):1173\u20131178. https:\/\/doi.org\/10.1038\/nature04209","journal-title":"Nature"},{"issue":"3","key":"471_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0118432","volume":"10","author":"T Saito","year":"2015","unstructured":"Saito T, Rehmsmeier M (2015) The precision-recall plot is more informative than the roc plot when evaluating binary classifiers on imbalanced datasets. PLoS ONE 10(3):1\u201321. https:\/\/doi.org\/10.1371\/journal.pone.0118432","journal-title":"PLoS ONE"},{"key":"471_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.103.022316","volume":"103","author":"A Tandon","year":"2021","unstructured":"Tandon A, Albeshri A, Thayananthan V, Alhalabi W, Radicchi F, Fortunato S (2021) Community detection in networks using graph embeddings. Phys Rev E 103:022316. https:\/\/doi.org\/10.1103\/PhysRevE.103.022316","journal-title":"Phys Rev E"},{"issue":"1","key":"471_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comnet\/cnaa007","volume":"8","author":"L Torres","year":"2020","unstructured":"Torres L, Chan KS, Eliassi-Rad T, Estrada E (2020) GLEE: geometric laplacian eigenmap embedding. J Complex Netw 8(1):1\u201317. https:\/\/doi.org\/10.1093\/comnet\/cnaa007","journal-title":"J Complex Netw"},{"issue":"1","key":"471_CR41","doi-asserted-by":"publisher","first-page":"7164","DOI":"10.1038\/s41598-020-63221-2","volume":"10","author":"M Torricelli","year":"2020","unstructured":"Torricelli M, Karsai M, Gauvin L (2020) weg2vec: event embedding for temporal networks. Sci Rep 10(1):7164. https:\/\/doi.org\/10.1038\/s41598-020-63221-2","journal-title":"Sci Rep"},{"issue":"4","key":"471_CR42","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1140\/epjb\/e2010-00219-x","volume":"76","author":"P Van Mieghem","year":"2010","unstructured":"Van Mieghem P, Wang H, Ge X, Tang S, Kuipers FA (2010) Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur Phys J B 76(4):643\u2013652. https:\/\/doi.org\/10.1140\/epjb\/e2010-00219-x","journal-title":"Eur Phys J B"},{"key":"471_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108230","volume":"122","author":"C Wang","year":"2022","unstructured":"Wang C, Pan S, Yu CP, Hu R, Long G, Zhang C (2022) Deep neighbor-aware embedding for node clustering in attributed graphs. Pattern Recogn 122:108230. https:\/\/doi.org\/10.1016\/j.patcog.2021.108230","journal-title":"Pattern Recogn"},{"key":"471_CR44","doi-asserted-by":"publisher","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201916. Association for Computing Machinery, New York, pp 1225\u20131234. https:\/\/doi.org\/10.1145\/2939672.2939753","DOI":"10.1145\/2939672.2939753"},{"key":"471_CR45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.100.022315","author":"S Wharrie","year":"2019","unstructured":"Wharrie S, Azizi L, Altmann EG (2019) Micro-, meso-, macroscales: the effect of triangles on communities in networks. Phys Rev E. https:\/\/doi.org\/10.1103\/PhysRevE.100.022315","journal-title":"Phys Rev E"},{"issue":"1","key":"471_CR46","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1186\/1752-0509-7-90","volume":"7","author":"W Winterbach","year":"2013","unstructured":"Winterbach W, Mieghem PV, Reinders M, Wang H, Ridder D (2013) Topology of molecular interaction networks. BMC Syst Biol 7(1):90. https:\/\/doi.org\/10.1186\/1752-0509-7-90","journal-title":"BMC Syst Biol"},{"issue":"1","key":"471_CR47","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1140\/epjds\/s13688-020-00248-5","volume":"9","author":"X-X Zhan","year":"2020","unstructured":"Zhan X-X, Li Z, Masuda N, Holme P, Wang H (2020) Susceptible-infected-spreading-based network embedding in static and temporal networks. EPJ Data Sci 9(1):30. https:\/\/doi.org\/10.1140\/epjds\/s13688-020-00248-5","journal-title":"EPJ Data Sci"},{"key":"471_CR48","doi-asserted-by":"publisher","unstructured":"Zhang D, Yin J, Zhu X, Zhang C (2018) SINE: scalable incomplete network embedding. In: Tao D, Thuraisingham B (eds) 2018 IEEE international conference on data mining (ICDM 2018). Proceedings\u2014IEEE international conference on data mining, ICDM. IEEE, Institute of Electrical and Electronics Engineers, New York, pp 737\u2013746. https:\/\/doi.org\/10.1109\/ICDM.2018.00089","DOI":"10.1109\/ICDM.2018.00089"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00471-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-022-00471-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00471-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T11:25:37Z","timestamp":1654255537000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-022-00471-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s41109-022-00471-1","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,3]]},"assertion":[{"value":"3 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"35"}}