Abstract

Multiplex networks arise when more than one source of relationships exists for a common set of nodes. Many approaches to deal with this kind of complex network data structure are reported in the literature. In this paper, we propose the use of factorial methods to visually explore the complex structure of multiplex networks. Specifically, the adjacency matrices derived from multiplex networks are analyzed using the DISTATIS technique, an extension of multidimensional scaling to three-way data. This technique allows the representation of the different types of relationships in both separate spaces for each layer and a compromise space. The analytical procedure is illustrated using a real world example and simulated data.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call