|(InfoVis.net - Home)|
See the contents of theInformation Visualization Journal by Palgrave Publishing
In the real world but specially in Internet, the relationship between individuals, objects and concepts are increasingly important. Just as an example, who is not connected today to one or more social networks?. These have become ubiquitous and constitute a vast truss of professional and leisure relations where we knit together our interests.
Consequently, the networks have ended up as important sources of information. How can we visualise them in an effective way?Â
From a mathematical standpoint a network can be considered as a graph (see also issue number 137). Each element of a graph (also called node) can be related to other elements of the same. Each relation is called arc, edge or also link.
The traditional representation of a graph consists of a set of points representing the nodes, linked by lines that bind the nodes that hold a relationship. Nevertheless, when the number of nodes begins to become high (above about 20 nodes and 20-30 links depending on the authors*), the problems of occlusion between links and even between nodes make understanding and interacting with the representation very difficult.
An alternative representation that, despite the fact that it's relatively unknown, appears to be very useful is the matrix representation.
For our purposes the matrix representation of a graph is an array of rows and columns where each row and column represent a node (for example a person) and in the intersections (cells) between them a 0 or a 1 (a coloured square or its absence) denotes that there exists a relation (or not) between the corresponding nodes.
So what we are actually painting is a boolean matrix of connectivity, also called and adjacency matrix. Notice that this allows us to visualise one to one, one to many and many to one links in a very simple way.
Obviously the matrix paradigm can be extended beyond the adjacency matrix by assigning a visual variable like the colour to each cell as a function of the value of a given numerical value like, for example, the traffic of a web link or the number of publications of which two nodes are coauthors.
The matrix layout guarantees that there's no occlusion neither between links nor between nodes. On the other hand the study of the visual patterns that arise let you identify clusters and "communities" by permuting the ordering of rows and columns so that the most mutually linked nodes become closer.Â
To be more systematic, the advantages and inconveniences of such a representation , according to the PhD Thesis by Nathalie Henry and the articles mentioned at the footer of this page, are the following:
J. Bertin, who sadly passed away just a few weeks ago, had already introduced in his book Semiologie Graphique the reordenable matrix. Effectively, being able to properly permute the order of rows and columns allows you to understand better the structure of the links and the identification of features making interesting patterns emerge.
In some ways what Bertin came to say is that the matrix provides us with a valid representation, but what makes it usable is choosing an appropriate ordering of rows and columns.
Particularly you can detect
Nevertheless the permutation of rows and columns is not unique so it's possible to obtain different views of the communities that make up a social network. ...
Book your free issue
Write your e-mail address in the white space below to subscribe and you will receive Inf@Vis! directly in your computer.
We ask you to re-write the e-mail in order for us to avoid sending e-mail to the wrong address. Thanks for your time.