{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T23:39:23Z","timestamp":1792885163385,"version":"4.5.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000265","name":"Medical Research Council","doi-asserted-by":"publisher","award":["Mr\/S004122\/1"],"award-info":[{"award-number":["Mr\/S004122\/1"]}],"id":[{"id":"10.13039\/501100000265","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Finding graph indices which are unbiased to network size and density is of high importance both within a given field and across fields for enhancing comparability of modern network science studies. The degree variance is an important metric for characterising network degree heterogeneity. Here, we provide an analytically valid normalisation of degree variance to replace previous normalisations which are either invalid or not applicable to all networks. It is shown that this normalisation provides equal values for graphs and their complements; it is maximal in the star graph (and its complement); and its expected value is constant with respect to density for Erd\u00f6s-R\u00e9nyi (ER) random graphs of the same size. We strengthen these results with model observations in ER random graphs, random geometric graphs, scale-free networks, random hierarchy networks and resting-state brain networks, showing that the proposed normalisation is generally less affected by both network size and density than previous normalisation attempts. The closed form expression proposed also benefits from high computational efficiency and straightforward mathematical analysis. Analysis of 184 real-world binary networks across different disciplines shows that normalised degree variance is not correlated with average degree and is robust to node and edge subsampling. Comparisons across subdomains of biological networks reveals greater degree heterogeneity among brain connectomes and food webs than in protein interaction networks.<\/jats:p>","DOI":"10.1007\/s41109-020-00273-3","type":"journal-article","created":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T10:03:16Z","timestamp":1592820196000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Normalised degree variance"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4615-9020","authenticated-orcid":false,"given":"Keith M.","family":"Smith","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Escudero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"3","key":"273_CR1","first-page":"64","volume":"10","author":"BM \u00c1brego","year":"2009","unstructured":"\u00c1brego, BM, Fern\u00e3ndez-Merchant S, Neubauer MG, Watkins W (2009) Sum of squares of degrees in a graph. J Inequalities Pure Appl Math 10(3):64.","journal-title":"J Inequalities Pure Appl Math"},{"key":"273_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R Ahlsewade","year":"1978","unstructured":"Ahlsewade, R, Katona GOH (1978) Graphs with maximal number of adjacent pairs of edges. Acta Math Acad Sci Hungar 32:97\u2013120.","journal-title":"Acta Math Acad Sci Hungar"},{"key":"273_CR3","first-page":"219","volume":"46","author":"MO Alberston","year":"1997","unstructured":"Alberston, MO (1997) The Irregularity of a Graph. Ars Combinatorica 46:219\u2013225.","journal-title":"Ars Combinatorica"},{"issue":"5439","key":"273_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512.","journal-title":"Science"},{"issue":"5864","key":"273_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1126\/science.1151419","volume":"319","author":"M Batty","year":"2008","unstructured":"Batty, M (2008) The Size, Scale, and Shape of Cities. Science 319(5864):769\u2013771.","journal-title":"Science"},{"key":"273_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0024-3795(92)90004-T","volume":"161","author":"FK Bell","year":"1992","unstructured":"Bell, FK (1992) A note on the irregularity of graphs. Lin Alg Appl 161:45\u201364.","journal-title":"Lin Alg Appl"},{"issue":"4","key":"273_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1038\/nrn2618","volume":"10","author":"E Bullmore","year":"2009","unstructured":"Bullmore, E, Sporns O (2009) Complex brain networks: graph theoretical analysis of structural and functional systems. Nat Rev Neurosci 10(4):312.","journal-title":"Nat Rev Neurosci"},{"issue":"6","key":"273_CR8","doi-asserted-by":"publisher","first-page":"062135","DOI":"10.1103\/PhysRevE.91.062135","volume":"91","author":"X Cao","year":"2015","unstructured":"Cao, X, Wang F, Han Y (2015) Ground-state phase-space structures of two-dimensional j spin glasses: a network approach. Phys Rev E 91(6):062135.","journal-title":"Phys Rev E"},{"key":"273_CR9","unstructured":"Clauset, A, Tucker E, Sainz M (2016) The Colorado Index of Complex Networks. https:\/\/icon.colorado.edu\/."},{"key":"273_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF02941924","volume":"21","author":"L Collatz","year":"1957","unstructured":"Collatz, L, Sinogowitz U (1957) Spektren endlicher Grafen. Abh Math Sem Univ Hamburg 21:63\u201377.","journal-title":"Abh Math Sem Univ Hamburg"},{"issue":"58","key":"273_CR11","first-page":"29","volume":"44","author":"D Cvetkovi\u0107","year":"1988","unstructured":"Cvetkovi\u0107, D, Rowlinson P (1988) On connected graphs with maximal index. Publications de l\u2019Institut Math\u00e9matique, Nouvelle S\u00e9rie 44(58):29\u201334.","journal-title":"Publications de l\u2019Institut Math\u00e9matique, Nouvelle S\u00e9rie"},{"key":"273_CR12","doi-asserted-by":"publisher","first-page":"016121","DOI":"10.1103\/PhysRevE.66.016121","volume":"66","author":"J Dall","year":"2002","unstructured":"Dall, J, Christensen M (2002) Random geometric graphs. Phys. Rev. E 66:016121.","journal-title":"Phys. Rev. E"},{"issue":"1-3","key":"273_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(97)00213-6","volume":"185","author":"D de Caen","year":"1998","unstructured":"de Caen, D (1998) An upper bound on the sum of squares of degrees in a graph. Discrete Math 185(1-3):245\u2013248.","journal-title":"Discrete Math"},{"key":"273_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2174\/1874213000902010007","volume":"2","author":"CF Dormann","year":"2009","unstructured":"Dormann, CF, Fr\u00fcnd J, Bl\u00fcthgen N, Gruber B (2009) Indices, Graphs and Null Models: Analyzing Bipartite Ecological Networks. Open Ecol J 2:7\u201324.","journal-title":"Open Ecol J"},{"key":"273_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P, R\u00e9nyi A (1959) On Random Graphs. Publicationes Mathematicae Debrecen 6:290\u2013297.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"273_CR16","doi-asserted-by":"publisher","first-page":"066102","DOI":"10.1103\/PhysRevE.82.066102","volume":"82","author":"E Estrada","year":"2010","unstructured":"Estrada, E (2010) Quantifying network heterogeneity. Phys Rev E 82:066102.","journal-title":"Phys Rev E"},{"key":"273_CR17","doi-asserted-by":"crossref","unstructured":"Ghasemian, A, Hosseinmardi H, Clauset A (2018) Evaluating overfit and underfit in models of network community structure. https:\/\/arxiv.org\/abs\/1802.10582.","DOI":"10.1109\/TKDE.2019.2911585"},{"issue":"4","key":"273_CR18","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, EN (1959) Random Graphs. Annals Math Stat 30(4):1141\u20131144.","journal-title":"Annals Math Stat"},{"key":"273_CR19","first-page":"30","volume":"13","author":"I Gutman","year":"2002","unstructured":"Gutman, I, Paule P (2002) The variance of vertex degrees of randomly generated graphs. Univ Beograd Publ Elektrotehn Fak 13:30\u201335.","journal-title":"Univ Beograd Publ Elektrotehn Fak"},{"issue":"8","key":"273_CR20","doi-asserted-by":"publisher","first-page":"e1000117","DOI":"10.1371\/journal.pcbi.1000117","volume":"4","author":"S Horvath","year":"2008","unstructured":"Horvath, S, Dong J (2008) Geometric interpretation of gene coexpression network analysis. PLOS Comp Bio 4(8):e1000117.","journal-title":"PLOS Comp Bio"},{"issue":"1","key":"273_CR21","doi-asserted-by":"publisher","first-page":"160757","DOI":"10.1098\/rsos.160757","volume":"4","author":"R Jacob","year":"2017","unstructured":"Jacob, R, Harikrishnan KP, Misra R, Ambika G (2017) Measure for degree heterogeneity in complex networks and its application to recurrence network analysis. R Soc Open Sci 4(1):160757.","journal-title":"R Soc Open Sci"},{"key":"273_CR22","first-page":"127","volume":"59","author":"X Li","year":"2008","unstructured":"Li, X, Shi Y (2008) A survey on the Randi\u0107 index. MATCH Commun Math Comput Chem 59:127\u2013156.","journal-title":"MATCH Commun Math Comput Chem"},{"key":"273_CR23","doi-asserted-by":"publisher","unstructured":"M\u00e4kinen, J, L\u00e4ms\u00e4 J, Lehtonen K (2019) The analysis of structural changes in Finnish sport policy network from 1989 to 2017. Int J Sport Policy Politics. https:\/\/doi.org\/10.1080\/19406940.2019.1583680.","DOI":"10.1080\/19406940.2019.1583680"},{"issue":"5569","key":"273_CR24","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1126\/science.1065103","volume":"296","author":"S Maslov","year":"2002","unstructured":"Maslov, S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296(5569):910\u2013913.","journal-title":"Science"},{"key":"273_CR25","doi-asserted-by":"publisher","unstructured":"Mochtak, M, Diviak T (2019) Looking Eastward: network analysis of Czech deputies and their foreign policy groups. Problems Post-Communism. https:\/\/doi.org\/10.1080\/10758216.2018.1561191.","DOI":"10.1080\/10758216.2018.1561191"},{"key":"273_CR26","unstructured":"Neurophysiological Biomarker Toolbox (2020). available from www.nbtwiki.net."},{"key":"273_CR27","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks","author":"MEJ Newman","year":"2010","unstructured":"Newman, MEJ (2010) Networks. Oxford University Press, Oxford."},{"key":"273_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J (1891) Die theorie der regularen graphs. Acta Math 15:193\u2013220.","journal-title":"Acta Math"},{"key":"273_CR29","doi-asserted-by":"publisher","unstructured":"Phillips, NE, Levy BL, Sampson RJ, Small ML, Wang RQ (2019) The social integration of American cities: network measures of connectedness based on everyday mobility across neighbourhoods. Sociological Methods Res. https:\/\/doi.org\/10.1177\/0049124119852386.","DOI":"10.1177\/0049124119852386"},{"key":"273_CR30","doi-asserted-by":"publisher","DOI":"10.1201\/b19046","volume-title":"Solved and unsolved problems of structural chemistry","author":"M Randi\u0107","year":"2016","unstructured":"Randi\u0107, M, Novi\u010d M, Plav\u0161i\u0107 D (2016) Solved and unsolved problems of structural chemistry. CRC Press, Boca Raton."},{"issue":"10","key":"273_CR31","first-page":"2019","volume":"36","author":"F Safaei","year":"1011","unstructured":"Safaei, F, Tabrizchi S, Hadian Rasanan AH, Zare M (1011) An energy-based heterogeneity measure for quantifying structural irregularity in complex networks. J Comput Sci 36(10):2019.","journal-title":"J Comput Sci"},{"issue":"10","key":"273_CR32","doi-asserted-by":"publisher","first-page":"e0186164","DOI":"10.1371\/journal.pone.0186164","volume":"12","author":"K Smith","year":"2017","unstructured":"Smith, K, Abasolo D, Escudero J (2017) Accounting for the complex hierarchical topology of EEG phase-based functional connectivity in network binarisation. PLoS ONE 12(10):e0186164.","journal-title":"PLoS ONE"},{"key":"273_CR33","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.neuroimage.2019.02.028","volume":"191","author":"KM Smith","year":"2019","unstructured":"Smith, KM, Bastin ME, Cox SR, Valdes-Hernandez M, Wiseman S, Escudero J, Sudlow C (2019) Hierarchical complexity of the adult human structural connectome. Neuroimage 191:205\u2013215.","journal-title":"Neuroimage"},{"key":"273_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jneumeth.2016.11.003","volume":"76","author":"K Smith","year":"2017","unstructured":"Smith, K, Escudero J (2017) The complex hierarchical topology of EEG functional connectivity. J Neurosci Methods 76:1\u201312.","journal-title":"J Neurosci Methods"},{"issue":"3","key":"273_CR35","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0378-8733(81)90014-9","volume":"3","author":"TAB Snijders","year":"1981","unstructured":"Snijders, TAB (1981) The degree variance: an index of graph heterogeneity. Soc Netw 3(3):163\u2013174.","journal-title":"Soc Netw"},{"issue":"11","key":"273_CR36","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1002\/hbm.20346","volume":"28","author":"CJ Stam","year":"2007","unstructured":"Stam, CJ, Nolte G, Daffertshofer A (2007) Phase lag index: Assessment of functional connectivity from multi channel EEG and MEG with diminished bias from common sources. Human Brain Mapping 28(11):1178\u20131193.","journal-title":"Human Brain Mapping"},{"key":"273_CR37","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, SH (2001) Exploring complex networks. Nature 410:268\u2013276.","journal-title":"Nature"},{"issue":"44","key":"273_CR38","doi-asserted-by":"publisher","first-page":"15775","DOI":"10.1523\/JNEUROSCI.3539-11.2011","volume":"31","author":"MP van den Heuvel","year":"2011","unstructured":"van den Heuvel, MP, Sporns O (2011) Rich-club organization of the human connectome. J Neurosci 31(44):15775\u201315786.","journal-title":"J Neurosci"},{"key":"273_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804052","volume-title":"Complex Social Networks","author":"F Vega-Redondo","year":"2007","unstructured":"Vega-Redondo, F (2007) Complex Social Networks. Cambridge University Press, Cambridge."},{"key":"273_CR40","doi-asserted-by":"publisher","first-page":"065102","DOI":"10.1103\/PhysRevE.69.065102","volume":"69","author":"MG Zimmermann","year":"2004","unstructured":"Zimmermann, MG, Eguiluz VM, San Miguel M (2004) Coevolution of dynamical states and interactions in dynamic networks. Phys Rev E 69:065102.","journal-title":"Phys Rev E"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00273-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-020-00273-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00273-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T18:40:54Z","timestamp":1696272054000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-020-00273-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s41109-020-00273-3","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"22 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"32"}}