{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:26:20Z","timestamp":1767677180687,"version":"3.41.0"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The dyadic effect is a phenomenon that occurs when the number of links between nodes sharing a common feature is larger than expected if the features are distributed randomly on the network. In this article, we consider the case when nodes are distinguished by a binary characteristic. Under these circumstances, two independent parameters, namely dyadicity and heterophilicity are able to detect the presence of the dyadic effect and to measure how much the considered characteristic affects the network topology. The distribution of nodes characteristics can be investigated within a two-dimensional space that represents the feasible region of the dyadic effect, which is bound by two upper bounds on dyadicity and heterophilicity. Using some network structural arguments, we are able to improve such upper bounds and introduce two new lower bounds, providing a reduction of the feasible region of the dyadic effect as well as constraining dyadicity and heterophilicity within a specific range. Some computational experiences show the bounds effectiveness and their usefulness with regards to different classes of networks.<\/jats:p>","DOI":"10.1093\/comnet\/cnx002","type":"journal-article","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T08:56:58Z","timestamp":1487149018000},"page":"694-711","source":"Crossref","is-referenced-by-count":15,"title":["Structural bounds on the dyadic effect"],"prefix":"10.1093","volume":"5","author":[{"given":"Matteo","family":"Cinelli","sequence":"first","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome Tor Vergata, Via del Politecnico, 1 - 00133 Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Ferraro","sequence":"additional","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome Tor Vergata, Via del Politecnico, 1 - 00133 Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Iovanella","sequence":"additional","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome Tor Vergata, Via del Politecnico, 1 - 00133 Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"2019071815295944800_B1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"2019071815295944800_B2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical Processes on Complex Networks","author":"Barrat","year":"2008"},{"key":"2019071815295944800_B3","doi-asserted-by":"crossref","first-page":"11433","DOI":"10.1073\/pnas.0811511106","article-title":"Assessing the relevance of node features for network structure","volume":"106","author":"Bianconi","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019071815295944800_B4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-42697-6_8","article-title":"Some insights into the relevance of nodes\u2019 characteristics in complex network structures","volume-title":"Designing Networks for Innovation and Improvisation, Proceedings of the 6th International COINs Conference","author":"Cinelli","year":"2016"},{"key":"2019071815295944800_B5","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1038\/nphys209","article-title":"Detecting rich-club ordering in complex networks","volume":"2","author":"Colizza","year":"2006","journal-title":"Nat. Phys."},{"key":"2019071815295944800_B6","article-title":"The igraph software package for complex network research","author":"Csardi","year":"2006","journal-title":"InterJournal"},{"key":"2019071815295944800_B7","doi-asserted-by":"crossref","first-page":"68006","DOI":"10.1209\/0295-5075\/97\/68006","article-title":"Robustness and assortativity for diffusion-like processes in scale-free networks","volume":"97","author":"D\u2019Agostino","year":"2012","journal-title":"EPL (Europhys. Lett.)"},{"key":"2019071815295944800_B8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2012-30802-x","article-title":"Scale-free homophilic network","volume":"86","author":"de Almeida","year":"2013","journal-title":"Eur. Phys. J. B"},{"key":"2019071815295944800_B9","doi-asserted-by":"crossref","first-page":"178701","DOI":"10.1103\/PhysRevLett.107.178701","article-title":"All scale-free networks are sparse","volume":"107","author":"Del Genio","year":"2011","journal-title":"Phys. Rev. Lett."},{"key":"2019071815295944800_B10","doi-asserted-by":"crossref","first-page":"1598","DOI":"10.1021\/cr3002356","article-title":"Protein contact networks: an emerging paradigm in chemistry","volume":"113","author":"Di Paola","year":"2012","journal-title":"Chem. Rev."},{"key":"2019071815295944800_B11","first-page":"264","article-title":"Graphs with prescribed degrees of vertices (in Hungarian)","volume":"11","author":"Erd\u0151s","year":"1960","journal-title":"Matematikai. Lapok"},{"key":"2019071815295944800_B12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"2019071815295944800_B13","doi-asserted-by":"crossref","first-page":"047101","DOI":"10.1103\/PhysRevE.84.047101","article-title":"Combinatorial study of degree assortativity in networks","volume":"84","author":"Estrada","year":"2011","journal-title":"Phys. Rev. E"},{"key":"2019071815295944800_B14","doi-asserted-by":"crossref","first-page":"24","DOI":"10.5772\/61802","article-title":"Organizing collaboration in inter-organizational innovation networks, from orchestration to choreography","volume":"7","author":"Ferraro","year":"2015","journal-title":"Int. J. Eng. Business Manag."},{"key":"2019071815295944800_B15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1504\/IJCEE.2016.073364","article-title":"Revealing correlations between structure and innovation attitude in inter-organisational innovation networks","volume":"6","author":"Ferraro","year":"2016","journal-title":"Int. J. Comput. Econ. Economet."},{"key":"2019071815295944800_B16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1504\/IJCEE.2016.077247","article-title":"On the influence of nodes\u2019 characteristic in inter-organisational innovation networks structure","volume":"6","author":"Ferraro","year":"2016","journal-title":"Int. J. Comput. Econ. Economet."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"2019071815295944800_B17"},{"key":"2019071815295944800_B18","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph. I","volume":"10","author":"Hakimi","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"2019071815295944800_B19","first-page":"1253","article-title":"A remark on the existence of finite graphs","volume":"80","author":"Havel","year":"1955","journal-title":"Casopis Pest. Mat"},{"key":"2019071815295944800_B20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13040-015-0062-4","article-title":"Functional dyadicity and heterophilicity of gene-gene interactions in statistical epistasis networks","volume":"8","author":"Hu","year":"2015","journal-title":"BioData Mining"},{"key":"2019071815295944800_B21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1515\/jib-2010-149","article-title":"Towards prediction and prioritization of disease genes by the modularity of human phenome-genome assembled network","volume":"7","author":"Jiang","year":"2010","journal-title":"J. Integr. Bioinform."},{"key":"2019071815295944800_B22","doi-asserted-by":"crossref","first-page":"2549","DOI":"10.1016\/j.febslet.2008.06.023","article-title":"Modularity in the genetic disease-phenotype network","volume":"582","author":"Jiang","year":"2008","journal-title":"FEBS Lett."},{"key":"2019071815295944800_B23","doi-asserted-by":"crossref","first-page":"392001","DOI":"10.1088\/1751-8113\/42\/39\/392001","article-title":"Degree-based graph construction","volume":"42","author":"Kim","year":"2009","journal-title":"J. Phys. A Math. Theor."},{"key":"2019071815295944800_B24","doi-asserted-by":"crossref","first-page":"012816","DOI":"10.1103\/PhysRevE.87.012816","article-title":"Random line graphs and a linear law for assortativity","volume":"87","author":"Liu","year":"2013","journal-title":"Phys. Rev. E"},{"key":"2019071815295944800_B25","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","volume":"27","author":"McPherson","year":"2001","journal-title":"Annu. Rev. Sociol."},{"volume-title":"The Structure and Dynamics of Networks: (Princeton Studies in Complexity)","year":"2006","author":"Newman","key":"2019071815295944800_B26"},{"key":"2019071815295944800_B27","doi-asserted-by":"crossref","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","article-title":"Mixing patterns in networks","volume":"67","author":"Newman","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2019071815295944800_B28","doi-asserted-by":"crossref","first-page":"2566","DOI":"10.1073\/pnas.012582999","article-title":"Random graph models of social networks","volume":"99","author":"Newman","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019071815295944800_B29","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1093\/comnet\/cnv005","article-title":"Assortativity in complex networks","volume":"3","author":"Noldus","year":"2015","journal-title":"J. Complex Netw."},{"key":"2019071815295944800_B30","doi-asserted-by":"crossref","first-page":"17916","DOI":"10.1073\/pnas.0705081104","article-title":"Distribution of node characteristics in complex networks","volume":"104","author":"Park","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"volume-title":"R: A Language and Environment for Statistical Computing","year":"2008","author":"R Development Core Team","key":"2019071815295944800_B31"},{"key":"2019071815295944800_B32","doi-asserted-by":"crossref","first-page":"11372","DOI":"10.1073\/pnas.1203593109","article-title":"High-cost, high-capacity backbone for global brain communication","volume":"109","author":"van den Heuvel","year":"2012","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019071815295944800_B33","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1111\/0081-1750.00098","article-title":"The cohesiveness of blocks in social networks: node connectivity and conditional density","volume":"34","author":"White","year":"2001","journal-title":"Sociol. Methodol."},{"key":"2019071815295944800_B34","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1038\/ejhg.2011.30","article-title":"The expanded human disease network combining protein\u2013protein interaction information","volume":"19","author":"Zhang","year":"2011","journal-title":"Eur. J. Hum. Genet."},{"key":"2019071815295944800_B35","doi-asserted-by":"crossref","first-page":"066103","DOI":"10.1103\/PhysRevE.86.066103","article-title":"Assortativity decreases the robustness of interdependent networks","volume":"86","author":"Zhou","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2019071815295944800_B36","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/LCOMM.2004.823426","article-title":"The rich-club phenomenon in the Internet topology","volume":"8","author":"Zhou","year":"2004","journal-title":"IEEE Commun. Lett."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/5\/5\/694\/20506164\/cnx002.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T11:01:48Z","timestamp":1749985308000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/5\/5\/694\/3078584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,22]]},"references-count":36,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,3,22]]},"published-print":{"date-parts":[[2017,10,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx002","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2017,10]]},"published":{"date-parts":[[2017,3,22]]}}}