{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T23:17:37Z","timestamp":1787008657636,"version":"3.56.0"},"reference-count":64,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1093\/comnet\/cnv005","type":"journal-article","created":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T23:42:26Z","timestamp":1427586146000},"page":"507-542","source":"Crossref","is-referenced-by-count":233,"title":["Assortativity in complex networks"],"prefix":"10.1093","volume":"3","author":[{"given":"Rogier","family":"Noldus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"key":"2015112502424934000_3.4.507.1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.208701"},{"key":"2015112502424934000_3.4.507.2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2006-00170-5"},{"key":"2015112502424934000_3.4.507.3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01070737"},{"key":"2015112502424934000_3.4.507.4","doi-asserted-by":"crossref","unstructured":"Van Mieghem P. (2014) Performance Analysis of Complex Networks and Systems. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9781107415874"},{"key":"2015112502424934000_3.4.507.5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"2015112502424934000_3.4.507.6","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"2015112502424934000_3.4.507.7","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/97\/68006"},{"key":"2015112502424934000_3.4.507.8","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.04.045"},{"key":"2015112502424934000_3.4.507.9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.047101"},{"key":"2015112502424934000_3.4.507.10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.75.046111"},{"key":"2015112502424934000_3.4.507.11","unstructured":"Konig M. Tessone C. Zenou Y. (2008) From Assortative to Dissortative Networks: The Role of Capacity. CCSS Working Paper Series."},{"key":"2015112502424934000_3.4.507.12","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.12.022"},{"key":"2015112502424934000_3.4.507.13","doi-asserted-by":"crossref","unstructured":"Litvak N. van der Hofstad R. (2013) Uncovering disassortativity in large scale-free networks. Phys. Rev. E, 87, 1\u201311.","DOI":"10.1103\/PhysRevE.87.022801"},{"key":"2015112502424934000_3.4.507.14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.87.012816"},{"key":"2015112502424934000_3.4.507.15","unstructured":"Manka-Krason A. Kulakowski K. (2010) Assortativity in random line graphs. Acta Phys. Pol. B, 3, 259\u2013268."},{"key":"2015112502424934000_3.4.507.16","unstructured":"Nguyen D. Tran D. (2010) On generating power-law networks with assortative mixing. International Conference on Communications and Electronics, Nha Trang, pp. 30\u201335."},{"key":"2015112502424934000_3.4.507.17","unstructured":"Piraveenan M. Prokopenko M. Zomaya A. (2011) On congruity of nodes and assortative information content in complex networks. School of information technologies, Sydney University, Technical Report 668."},{"key":"2015112502424934000_3.4.507.18","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/84\/28002"},{"key":"2015112502424934000_3.4.507.19","doi-asserted-by":"crossref","unstructured":"Piraveenan M. Prokopenko M. Zomaya A. (2008) Assortativeness and information in scale-free networks. Eur. Phys. J. B, 67, 291\u2013300.","DOI":"10.1140\/epjb\/e2008-00473-5"},{"key":"2015112502424934000_3.4.507.20","unstructured":"Piraveenan M. Prokopenko M. Zomaya A. (2009) Assortative Mixing in Directed Networks.School of information technologies, Sydney University, Technical Report 637."},{"key":"2015112502424934000_3.4.507.21","unstructured":"Piraveenan M. (2010) Topological analysis of complex networks using assortativity. PhD thesis."},{"key":"2015112502424934000_3.4.507.22","unstructured":"Piraveenan M. Prokopenko M. Zomaya A. (2010) Assortative mixing in directed biological networks. IEEE\/ACM Trans. Comput. Biol. Bioinf., 9, 66\u201378."},{"key":"2015112502424934000_3.4.507.23","unstructured":"Piraveenan M. Prokopenko M. Zomaya A. (2006) Information-cloning of scale-free networks. Proceedings of the 9th European conference on Advances in artificial life, Lisbon, pp. 925\u2013935."},{"key":"2015112502424934000_3.4.507.24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.056113"},{"key":"2015112502424934000_3.4.507.25","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2010-00219-x"},{"key":"2015112502424934000_3.4.507.26","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2011-20118-x"},{"key":"2015112502424934000_3.4.507.27","doi-asserted-by":"crossref","unstructured":"Winterbach W. Ridder D. Wang H. Reinders M. Van Mieghem P. (2012) Do greedy assortativity optimization algorithms produce good results? Eur. Phys. J.B, 85, article 151.","DOI":"10.1140\/epjb\/e2012-20899-2"},{"key":"2015112502424934000_3.4.507.28","unstructured":"Xia Y. Tse C. Lau F. (2012) Effect of assortativity on traffic performance in scale-free networks IEEE Int. Symp. on Circuits Syst., 906\u2013909. http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=6272190&sortType%3Dasc_p_Sequence%26filter%3DAND(p_IS_Number%3A6270389)%26pageNumber%3D10 ."},{"key":"2015112502424934000_3.4.507.29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056106"},{"key":"2015112502424934000_3.4.507.30","unstructured":"Xulvi-Brunet R. Sokolov I. (2005) Changing correlations in networks: assortativity and dissortativity. Acta Phys. Pol. B, 36, 1431\u20131455."},{"key":"2015112502424934000_3.4.507.31","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127408022536"},{"key":"2015112502424934000_3.4.507.32","doi-asserted-by":"crossref","unstructured":"hou D. Stanley H. D\u2019Agostino G. Scala A. Assortativity decreases the robustness of interdependent networks. Phys. Rev. E, 86, 066103, 1\u20137.","DOI":"10.1103\/PhysRevE.86.066103"},{"key":"2015112502424934000_3.4.507.33","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0912671107"},{"key":"2015112502424934000_3.4.507.34","doi-asserted-by":"crossref","unstructured":"Van Mieghem P. (2010) Graph Spectra for Complex Networks. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9780511921681"},{"key":"2015112502424934000_3.4.507.35","doi-asserted-by":"crossref","unstructured":"Erd\u0151s P. R\u00e9nyi A. (1959) On random graphs. Publicationes Mathematicae, 6, 290\u2013297.","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"2015112502424934000_3.4.507.36","unstructured":"Erd\u0151s P. R\u00e9nyi A. (1960) On the evolution of random graphs. Publ. Math. Inst. the Hung. Acad. Sci., 5, 17\u201361."},{"key":"2015112502424934000_3.4.507.37","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"2015112502424934000_3.4.507.38","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"2015112502424934000_3.4.507.39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.041902"},{"key":"2015112502424934000_3.4.507.40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.037101"},{"key":"2015112502424934000_3.4.507.41","unstructured":"Grossman J. Ion P. (1995) On a portion of the well-known collaboration graph. Conf. Comb. Graph Theory Comput., 108, 129\u2013131."},{"key":"2015112502424934000_3.4.507.42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.258701"},{"key":"2015112502424934000_3.4.507.43","doi-asserted-by":"publisher","DOI":"10.1214\/12-SSY076"},{"key":"2015112502424934000_3.4.507.44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44485-5_9"},{"key":"2015112502424934000_3.4.507.45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.021924"},{"key":"2015112502424934000_3.4.507.46","unstructured":"Spearman C. Refer to http:\/\/udel.edu\/~mcdonald\/statspearman.html for explanation of Spearman's rho."},{"key":"2015112502424934000_3.4.507.47","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu007"},{"key":"2015112502424934000_3.4.507.48","doi-asserted-by":"crossref","unstructured":"Noldus R. Van Mieghem P. (2013) Effect of degree-preserving, assortative rewiring on OSPF router configuration. 25th International Teletraffic Congress (ITC), Shanghai, 10\u201312 September 2013.","DOI":"10.1109\/ITC.2013.6662963"},{"key":"2015112502424934000_3.4.507.49","doi-asserted-by":"publisher","DOI":"10.1126\/science.1065103"},{"key":"2015112502424934000_3.4.507.50","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.052810"},{"key":"2015112502424934000_3.4.507.51","doi-asserted-by":"crossref","unstructured":"Li L. Alderson D. Willinger W. Doyle J. (2004) A first-principles approach to understanding the internet's router-level topology. ACM SIGCOMM Comput. Commun. Rev., 34, 3\u201314.","DOI":"10.1145\/1030194.1015470"},{"key":"2015112502424934000_3.4.507.52","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"2015112502424934000_3.4.507.53","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2006-00008-2"},{"key":"2015112502424934000_3.4.507.54","doi-asserted-by":"publisher","DOI":"10.1080\/00018730110112519"},{"key":"2015112502424934000_3.4.507.55","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.062802"},{"key":"2015112502424934000_3.4.507.56","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.046116"},{"key":"2015112502424934000_3.4.507.57","unstructured":"Fiedler M. (1973) Algebraic connectivity of graphs. Czech. Math. J., 23, 298\u2013305."},{"key":"2015112502424934000_3.4.507.58","unstructured":"Cvetkovi\u00e6 D. Doob M. Sachs H. (1980) Spectra of Graphs: Theory and Application. New York: Academic Press."},{"key":"2015112502424934000_3.4.507.59","unstructured":"Mohar B. (1991) The Laplacian spectrum of graphs. Graph theory, combinatorics and applications\u201d, Wiley, 2, 871\u2013898."},{"key":"2015112502424934000_3.4.507.60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01164627"},{"key":"2015112502424934000_3.4.507.61","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.02.024"},{"key":"2015112502424934000_3.4.507.62","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnt004"},{"key":"2015112502424934000_3.4.507.63","doi-asserted-by":"crossref","unstructured":"Liu D. Trajanovski S. Van Mieghem P. (2014) ILIGRA: an efficient inverse line graph algorithm. J. Math. Model. Algorithms Oper. Res. (to appear).","DOI":"10.1007\/s10852-014-9251-2"},{"key":"2015112502424934000_3.4.507.64","unstructured":"Zhang G. Cheng S. Zhang G. (2011) A universal assortativity measure for network analysis. Phys. Rev. E. http:\/\/arxiv.org\/abs\/1212.6456 ."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/3\/4\/507\/2328341\/cnv005.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T21:54:22Z","timestamp":1691531662000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnv005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":64,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,11,23]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1093\/comnet\/cnv005"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnv005","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}