000056094 001__ 56094 000056094 005__ 20210121114543.0 000056094 0247_ $$2doi$$a10.1088/1367-2630/17/7/073029 000056094 0248_ $$2sideral$$a91236 000056094 037__ $$aART-2015-91236 000056094 041__ $$aeng 000056094 100__ $$0(orcid)0000-0002-5655-1587$$aCozzo, E.$$uUniversidad de Zaragoza 000056094 245__ $$aStructure of triadic relations in multiplex networks 000056094 260__ $$c2015 000056094 5060_ $$aAccess copy available to the general public$$fUnrestricted 000056094 5203_ $$aRecent advances in the study of networked systems have highlighted that our interconnected world is composed of networks that are coupled to each other through different ‘layers’ that each represent one of many possible subsystems or types of interactions. Nevertheless, it is traditional to aggregate multilayer networks into a single weighted network in order to take advantage of existing tools. This is admittedly convenient, but it is also extremely problematic, as important information can be lost as a result. It is therefore important to develop multilayer generalizations of network concepts. In this paper, we analyze triadic relations and generalize the idea of transitivity to multiplex networks. By focusing on triadic relations, which yield the simplest type of transitivity, we generalize the concept and computation of clustering coefficients to multiplex networks. We show how the layered structure of such networks introduces a new degree of freedom that has a fundamental effect on transitivity. We compute multiplex clustering coefficients for several real multiplex networks and illustrate why one must take great care when generalizing standard network concepts to multiplex networks. We also derive analytical expressions for our clustering coefficients for ensemble averages of networks in a family of random multiplex networks. Our analysis illustrates that social networks have a strong tendency to promote redundancy by closing triads at every layer and that they thereby have a different type of multiplex transitivity from transportation networks, which do not exhibit such a tendency. These insights are invisible if one only studies aggregated networks. 000056094 536__ $$9info:eu-repo/grantAgreement/ES/MINECO/FIS2011-25167$$9info:eu-repo/grantAgreement/EC/FP7/317614/EU/Mathematical framework for multiplex networks/PLEXMATH 000056094 540__ $$9info:eu-repo/semantics/openAccess$$aby$$uhttp://creativecommons.org/licenses/by/3.0/es/ 000056094 590__ $$a3.57$$b2015 000056094 591__ $$aPHYSICS, MULTIDISCIPLINARY$$b10 / 79 = 0.127$$c2015$$dQ1$$eT1 000056094 592__ $$a2.33$$b2015 000056094 593__ $$aPhysics and Astronomy (miscellaneous)$$c2015$$dQ1 000056094 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion 000056094 700__ $$aKivelä, M. 000056094 700__ $$aDomenico, M.D. 000056094 700__ $$aSolé-Ribalta, A. 000056094 700__ $$aArenas, A. 000056094 700__ $$aGómez, S. 000056094 700__ $$aPorter, M.A. 000056094 700__ $$0(orcid)0000-0002-0895-1893$$aMoreno, Y.$$uUniversidad de Zaragoza 000056094 7102_ $$12004$$2405$$aUniversidad de Zaragoza$$bDpto. Física Teórica$$cÁrea Física Teórica 000056094 773__ $$g17, 7 (2015), 073029 [20 pp]$$pNew j. phys.$$tNew Journal of Physics$$x1367-2630 000056094 8564_ $$s900411$$uhttps://zaguan.unizar.es/record/56094/files/texto_completo.pdf$$yVersión publicada 000056094 8564_ $$s12818$$uhttps://zaguan.unizar.es/record/56094/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada 000056094 909CO $$ooai:zaguan.unizar.es:56094$$particulos$$pdriver 000056094 951__ $$a2021-01-21-11:17:39 000056094 980__ $$aARTICLE