{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:20:54Z","timestamp":1768990854717,"version":"3.49.0"},"reference-count":39,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T00:00:00Z","timestamp":1686700800000},"content-version":"vor","delay-in-days":54,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["18\/CRT\/6049"],"award-info":[{"award-number":["18\/CRT\/6049"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this work, we explore degree assortativity in complex networks, and extend its usual definition beyond that of nearest neighbours. We apply this definition to model networks, and describe a rewiring algorithm that induces assortativity. We compare these results to real networks. Social networks in particular tend to be assortatively mixed by degree in contrast to many other types of complex networks. However, we show here that these positive correlations diminish after one step and in most of the empirical networks analysed. Properties besides degree support this, such as the number of papers in scientific coauthorship networks, with no correlations beyond nearest neighbours. Beyond next-nearest neighbours we also observe a disassortative tendency for nodes three steps away indicating that nodes at that distance are more likely different than similar.<\/jats:p>","DOI":"10.1093\/comnet\/cnad016","type":"journal-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T07:49:04Z","timestamp":1686728944000},"source":"Crossref","is-referenced-by-count":3,"title":["Correlation distances in social networks"],"prefix":"10.1093","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5163-9264","authenticated-orcid":false,"given":"P\u00e1draig","family":"MacCarron","sequence":"first","affiliation":[{"name":"MACSI, Department of Mathematics and Statistics, University of Limerick , Limerick V94 T9PX, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5572-4645","authenticated-orcid":false,"given":"Shane","family":"Mannion","sequence":"additional","affiliation":[{"name":"MACSI, Department of Mathematics and Statistics, University of Limerick , Limerick V94 T9PX, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Platini","sequence":"additional","affiliation":[{"name":"Applied Mathematics Research Centre, Coventry University , Coventry CV1 5FB, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,6,14]]},"reference":[{"key":"2023061407485598100_cnad016-B1","doi-asserted-by":"crossref","first-page":"036122","DOI":"10.1103\/PhysRevE.68.036122","article-title":"Why social networks are different from other types of networks","volume":"68","author":"Newman","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2023061407485598100_cnad016-B2","doi-asserted-by":"crossref","first-page":"18003","DOI":"10.1209\/0295-5075\/86\/18003","article-title":"Disassortative mixing in online social networks","volume":"86","author":"Hu","year":"2009","journal-title":"Europhys. Lett"},{"key":"2023061407485598100_cnad016-B3","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1038\/scientificamerican0879-158","article-title":"Problems in physics with many scales of length","volume":"241","author":"Wilson","year":"1979","journal-title":"Sci. Am"},{"key":"2023061407485598100_cnad016-B4","doi-asserted-by":"crossref","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","article-title":"Assortative mixing in networks","volume":"89","author":"Newman","year":"2002","journal-title":"Phys. Rev. Lett"},{"key":"2023061407485598100_cnad016-B5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","article-title":"Birds of a feather: Homophily in social networks","author":"Mcpherson","year":"2001","journal-title":"Annu. Rev. Sociol"},{"key":"2023061407485598100_cnad016-B6","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1056\/NEJMsa066082","article-title":"The spread of obesity in a large social network over 32 years","volume":"357","author":"Christakis","year":"2007","journal-title":"N. Eng. J. Med"},{"key":"2023061407485598100_cnad016-B7","volume-title":"Connected: The Surprising Power of Our Social Networks and How They Shape Our Lives","author":"Christakis","year":"2009"},{"key":"2023061407485598100_cnad016-B8","article-title":"The spread of evidence-poor medicine via flawed social-network analysis","volume":"2","author":"Lyons","year":"2011","journal-title":"Stat. Polit. Policy"},{"key":"2023061407485598100_cnad016-B9","doi-asserted-by":"crossref","first-page":"035007","DOI":"10.1088\/2632-072X\/abb4c5","article-title":"Emergence of long-range correlations in random networks","volume":"1","author":"Mizutaka","year":"2020","journal-title":"J. Phys. Complex"},{"key":"2023061407485598100_cnad016-B10","doi-asserted-by":"crossref","first-page":"062308","DOI":"10.1103\/PhysRevE.97.062308","article-title":"General formulation of long-range degree correlations in complex networks","volume":"97","author":"Fujiki","year":"2018","journal-title":"Phys. Rev. E"},{"key":"2023061407485598100_cnad016-B11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-015-0011-x","article-title":"Long-range degree correlations in complex networks","volume":"2","author":"Mayo","year":"2015","journal-title":"Comput. Soc. Netw"},{"key":"2023061407485598100_cnad016-B12","doi-asserted-by":"crossref","first-page":"28002","DOI":"10.1209\/0295-5075\/90\/28002","article-title":"Quantifying long-range correlations in complex networks beyond nearest neighbors","volume":"90","author":"Rybski","year":"2010","journal-title":"Europhys. Lett"},{"key":"2023061407485598100_cnad016-B13","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1016\/j.ejor.2017.04.028","article-title":"Higher order assortativity in complex networks","volume":"262","author":"Arcagni","year":"2017","journal-title":"Eur. J. Oper. Res"},{"key":"2023061407485598100_cnad016-B14","first-page":"262","article-title":"Two-walks degree assortativity in graphs and networks","volume":"311","author":"Allen-Perkins","year":"2017","journal-title":"Appl. Math. Comput"},{"key":"2023061407485598100_cnad016-B15","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/1021092","article-title":"Computers and the theory of statistics: Thinking the unthinkable","volume":"21","author":"Efron","year":"1979","journal-title":"SIAM Rev"},{"key":"2023061407485598100_cnad016-B16","first-page":"54","article-title":"Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy","author":"Efron","year":"1986","journal-title":"Stat. Sci"},{"key":"2023061407485598100_cnad016-B17","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1198\/016214507000000446","article-title":"Goodness of fit of social network models","volume":"103","author":"Hunter","year":"2008","journal-title":"J. Am. Stat. Assoc"},{"key":"2023061407485598100_cnad016-B18","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1001\/jama.1997.03550100049038","article-title":"Protecting adolescents from harm: Findings from the National Longitudinal Study on Adolescent Health","volume":"278","author":"Resnick","year":"1997","journal-title":"JAMA"},{"key":"2023061407485598100_cnad016-B19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community structure in jazz","volume":"6","author":"Gleiser","year":"2003","journal-title":"Adv. Complex Syst"},{"key":"2023061407485598100_cnad016-B20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","article-title":"What\u2019s in a crowd? Analysis of face-to-face behavioral networks","volume":"271","author":"Isella","year":"2011","journal-title":"J. Theor. Biol"},{"key":"2023061407485598100_cnad016-B21","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Phys. Rev. E"},{"key":"2023061407485598100_cnad016-B22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","article-title":"Peer influence groups: Identifying dense clusters in large networks","volume":"23","author":"Moody","year":"2001","journal-title":"Soc. Netw"},{"key":"2023061407485598100_cnad016-B23","author":"Kunegis","year":"2013"},{"key":"2023061407485598100_cnad016-B24","doi-asserted-by":"crossref","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","article-title":"Models of social networks based on social distance attachment","volume":"70","author":"Bogu\u00f1\u00e1","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2023061407485598100_cnad016-B25","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","article-title":"The structure of scientific collaboration networks","volume":"98","author":"Newman","year":"2001","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023061407485598100_cnad016-B26","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"2023061407485598100_cnad016-B27","article-title":"Learning to discover social circles in ego networks","volume":"25","author":"Leskovec","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"2023061407485598100_cnad016-B28","first-page":"151","author":"De Choudhury","year":"2009"},{"key":"2023061407485598100_cnad016-B29","author":"Kunegis","year":"2013"},{"key":"2023061407485598100_cnad016-B30","first-page":"37","author":"Viswanath","year":"2009"},{"key":"2023061407485598100_cnad016-B31","first-page":"37","author":"Viswanath","year":"2009"},{"key":"2023061407485598100_cnad016-B32","first-page":"741","author":"Kunegis","year":"2009"},{"key":"2023061407485598100_cnad016-B33","first-page":"217","volume-title":"European Conference on Machine Learning","author":"Klimt","year":"2004"},{"key":"2023061407485598100_cnad016-B34","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec","year":"2009","journal-title":"Internet Math"},{"key":"2023061407485598100_cnad016-B35","first-page":"1343","author":"Kunegis","year":"2013"},{"key":"2023061407485598100_cnad016-B36","doi-asserted-by":"crossref","first-page":"P09020","DOI":"10.1088\/1742-5468\/2007\/09\/P09020","article-title":"How to become a superhero","volume":"2007","author":"Gleiser","year":"2007","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2023061407485598100_cnad016-B37","doi-asserted-by":"crossref","first-page":"28002","DOI":"10.1209\/0295-5075\/99\/28002","article-title":"Universal properties of mythological networks","volume":"99","author":"Mac Carron","year":"2012","journal-title":"Europhys. Lett"},{"key":"2023061407485598100_cnad016-B38","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.socnet.2010.06.001","article-title":"Measuring social dynamics in a massive multiplayer online game","volume":"32","author":"Szell","year":"2010","journal-title":"Soc. Netw"},{"key":"2023061407485598100_cnad016-B39","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0378-8733(02)00039-4","article-title":"Ego-centered networks and the ripple effect","volume":"25","author":"Newman","year":"2003","journal-title":"Soc. Netw"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/3\/cnad016\/50599857\/cnad016.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/3\/cnad016\/50599857\/cnad016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T07:49:27Z","timestamp":1686728967000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnad016\/7197486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,21]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4,21]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnad016","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,6,1]]},"published":{"date-parts":[[2023,4,21]]},"article-number":"cnad016"}}