{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:47:44Z","timestamp":1753876064830,"version":"3.41.2"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:00:00Z","timestamp":1596585600000},"content-version":"vor","delay-in-days":65,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clustering coefficient. The closure coefficient or transitivity is another method to measure triadic closure. This statistic measures clustering from the head node of a triangle (instead of from the centre node, as in the often studied clustering coefficient). We perform a first exploratory analysis of the behaviour of the local closure coefficient in two random graph models that create simple networks with power-law degrees: the hidden-variable model and the hyperbolic random graph. We show that the closure coefficient behaves significantly different in these simple random graph models than in the previously studied multigraph models. We also relate the closure coefficient of high-degree vertices to the clustering coefficient and the average nearest neighbour degree.<\/jats:p>","DOI":"10.1093\/comnet\/cnaa020","type":"journal-article","created":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T11:30:53Z","timestamp":1591788653000},"source":"Crossref","is-referenced-by-count":3,"title":["Closure coefficients in scale-free complex networks"],"prefix":"10.1093","volume":"8","author":[{"given":"Clara","family":"Stegehuis","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Mathematics and Computer Science, University of Twente , The Netherlands"}]}],"member":"286","published-online":{"date-parts":[[2020,8,5]]},"reference":[{"key":"2022060620002481400_B1","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan,","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"journal-title":"The anatomy of the Facebook social graph","author":"Ugander,","key":"2022060620002481400_B2"},{"key":"2022060620002481400_B3","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts,","year":"1998","journal-title":"Nature"},{"key":"2022060620002481400_B4","doi-asserted-by":"crossref","first-page":"036112","DOI":"10.1103\/PhysRevE.68.036112","article-title":"Class of correlated random networks with hidden variables","volume":"68","author":"Bogu\u00f1\u00e1,","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B5","doi-asserted-by":"crossref","first-page":"026120","DOI":"10.1103\/PhysRevE.86.026120","article-title":"Clustering of random scale-free networks","volume":"86","author":"Colomer-de Simon,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B6","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1038\/srep00793","article-title":"Network cosmology","volume":"2","author":"Krioukov,","year":"2012","journal-title":"Sci. Rep."},{"key":"2022060620002481400_B7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.physa.2003.06.002","article-title":"Detection of topological patterns in complex networks: correlation profile of the internet","volume":"333","author":"Maslov,","year":"2004","journal-title":"Phys. A"},{"key":"2022060620002481400_B8","doi-asserted-by":"crossref","first-page":"295101","DOI":"10.1088\/1751-8121\/ab2269","article-title":"Scale-free network clustering in hyperbolic and other random graphs","volume":"52","author":"Stegehuis,","year":"2019","journal-title":"J. Phys. A"},{"key":"2022060620002481400_B9","doi-asserted-by":"crossref","first-page":"042309","DOI":"10.1103\/PhysRevE.96.042309","article-title":"Clustering spectrum of scale-free networks","volume":"96","author":"Stegehuis,","year":"2017","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B10","doi-asserted-by":"crossref","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","article-title":"Large-scale topological and dynamical properties of the internet","volume":"65","author":"V\u00e1zquez,","year":"2002","journal-title":"Phys. Rev. E"},{"volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 08","year":"2008","author":"Becchetti,","key":"2022060620002481400_B11"},{"key":"2022060620002481400_B12","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1038\/srep02517","article-title":"Alvarez-Hamelin, and M. Bogu\u00f1\u00e1. Deciphering the global organization of clustering in real complex networks","volume":"3","author":"Colomer-de Sim\u00f3n,","year":"2013","journal-title":"Sci. Rep."},{"key":"2022060620002481400_B13","doi-asserted-by":"crossref","first-page":"088701","DOI":"10.1103\/PhysRevLett.97.088701","article-title":"Percolation and epidemic thresholds in clustered networks","volume":"97","author":"Serrano,","year":"2006","journal-title":"Phys. Rev. Lett."},{"volume-title":"Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining - WSDM 19","year":"2019","author":"Yin,","key":"2022060620002481400_B14"},{"key":"2022060620002481400_B15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/0022250X.1980.9989907","article-title":"Transitivity in Stochastic Graphs and Digraphs","volume":"7","author":"Frank","year":"1980","journal-title":"J. Math. Sociol."},{"key":"2022060620002481400_B16","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1080\/0022250X.1979.9989889","article-title":"Matrix measures for transitivity and balance","volume":"6","author":"Harary","year":"1979","journal-title":"J. Math. Sociol."},{"key":"2022060620002481400_B17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/nws.2020.20","article-title":"Measuring directed triadic closure with closure coefficients","author":"Yin,","year":"2020","journal-title":"Network Science"},{"key":"2022060620002481400_B18","doi-asserted-by":"crossref","first-page":"022307","DOI":"10.1103\/PhysRevE.95.022307","article-title":"Local clustering in scale-free networks with hidden variables","volume":"95","author":"Hofstad van der,","year":"2017","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B19","doi-asserted-by":"crossref","first-page":"208302","DOI":"10.1103\/PhysRevLett.116.208302","article-title":"Clustering implies geometry in networks","volume":"116","author":"Krioukov,","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"2022060620002481400_B20","doi-asserted-by":"crossref","first-page":"027103","DOI":"10.1103\/PhysRevE.71.027103","article-title":"Generation of uncorrelated random scale-free networks","volume":"71","author":"Catanzaro,","year":"2005","journal-title":"Phys. Rev. E"},{"author":"Hofstad van der,","key":"2022060620002481400_B21"},{"key":"2022060620002481400_B22","article-title":"Average nearest neighbor degrees in scale-free networks","author":"Yao,","year":"2018","journal-title":"Internet Math."},{"key":"2022060620002481400_B23","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Internet: diameter of the world-wide web","volume":"401","author":"Albert,","year":"1999","journal-title":"Nature"},{"key":"2022060620002481400_B24","first-page":"251","volume-title":"ACM SIGCOMM Computer Communication Review","author":"Faloutsos,","year":"1999"},{"key":"2022060620002481400_B25","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","article-title":"The large-scale organization of metabolic networks","volume":"407","author":"Jeong,","year":"2000","journal-title":"Nature"},{"key":"2022060620002481400_B26","doi-asserted-by":"crossref","first-page":"022807","DOI":"10.1103\/PhysRevE.89.022807","article-title":"Fluctuation analysis in complex networks modeled by hidden-variable models: necessity of a large cutoff in hidden-variable models","volume":"89","author":"Ostilli,","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B27","doi-asserted-by":"crossref","DOI":"10.1017\/9781316779422","volume-title":"Random Graphs and Complex Networks, vol. 1","author":"Hofstad van der","year":"2017"},{"key":"2022060620002481400_B28","doi-asserted-by":"crossref","first-page":"14103","DOI":"10.1038\/ncomms14103","article-title":"The geometric nature of weights in real complex networks","volume":"8","author":"Allard,","year":"2017","journal-title":"Nat. Commun."},{"key":"2022060620002481400_B29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms1063","article-title":"Sustaining the internet with hyperbolic mapping","volume":"1","author":"Bogu\u00f1\u00e1,","year":"2010","journal-title":"Nat. Commun."},{"key":"2022060620002481400_B30","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.1103\/PhysRevE.92.032812","article-title":"Hyperbolicity measures democracy in real-world networks","volume":"92","author":"Borassi,","year":"2015","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B31","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.1038\/srep33441","article-title":"The hidden hyperbolic geometry of international trade: world trade atlas","volume":"6","author":"Garc\u00eda-P\u00e9rez,","year":"2016","journal-title":"Sci. Rep."},{"key":"2022060620002481400_B32","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks","volume":"82","author":"Krioukov,","year":"2010","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B33","doi-asserted-by":"crossref","first-page":"6762","DOI":"10.1038\/s41598-019-43050-8","article-title":"Variational principle for scale-free network motifs","volume":"9","author":"Stegehuis,","year":"2019","journal-title":"Sci. Rep."},{"key":"2022060620002481400_B34","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.97.052306","article-title":"Higher-order clustering in networks","volume":"97","author":"Yin,","year":"2018","journal-title":"Phys. Rev. E"},{"key":"2022060620002481400_B35","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1017\/jpr.2019.45","article-title":"Degree correlations in scale-free random graph models","volume":"56","author":"Stegehuis,","year":"2019","journal-title":"J. Appl. Prob."},{"key":"2022060620002481400_B36","doi-asserted-by":"crossref","first-page":"15879","DOI":"10.1073\/pnas.252631999","article-title":"The average distances in random graphs with given expected degrees","volume":"99","author":"Chung,","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"journal-title":"Optimal subgraph structures in scale-free configuration models","author":"Hofstad van der,","key":"2022060620002481400_B37"},{"key":"2022060620002481400_B38","first-page":"573","article-title":"Random hyperbolic graphs: degree sequence and clustering","volume-title":"ICALP Proceedings 2012, Part II","author":"Gugelmann,","year":"2012"},{"issue":"3","key":"2022060620002481400_B39","doi-asserted-by":"crossref","first-page":"P3","DOI":"10.37236\/4958","article-title":"On the largest component of a hyperbolic model of complex networks","volume":"22","author":"Bode,","year":"2015","journal-title":"Electron. J. Combin."},{"key":"2022060620002481400_B40","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1007\/s10955-018-1952-x","article-title":"Triadic closure in configuration models with unbounded degree fluctuations","volume":"173","author":"Hofstad van der,","year":"2018","journal-title":"J. Stat. Phys."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/8\/3\/cnaa020\/43965076\/comnet_8_3_cnaa020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/8\/3\/cnaa020\/43965076\/comnet_8_3_cnaa020.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:01:04Z","timestamp":1654545664000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnaa020\/5881383"}},"subtitle":[],"editor":[{"given":"Matthieu","family":"Latapy","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,6,1]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnaa020","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2020,6]]},"published":{"date-parts":[[2020,6,1]]},"article-number":"cnaa020"}}