Layout algorithm for clustered graphs to analyze community interactions in social networks

Juan David Cruz Gomez 1, 2 Cécile Bothorel 1, 2 François Poulet 3
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
3 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Most layout algorithms for clustered graphs have been designed to differentiate the groups within the graph, however they do not take into account the interactions between such groups. Identifying these interactions allows to understand how the different communities exchange messages or information, and allows the social network researcher identifying key actors, social roles and paths from one community to another. These interactions are performed by actors who actually share links with different communities. Thus, dividing the set of nodes into those who interact with several communities and those who only interact with their own communities, will give some insight about how the communities interact.
Complete list of metadatas
Contributor : Bibliothèque Télécom Bretagne <>
Submitted on : Monday, October 8, 2012 - 3:28:04 PM
Last modification on : Thursday, October 17, 2019 - 12:36:43 PM


  • HAL Id : hal-00739637, version 1


Juan David Cruz Gomez, Cécile Bothorel, François Poulet. Layout algorithm for clustered graphs to analyze community interactions in social networks. ASONAM - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2012, Istambul, Turkey. ⟨hal-00739637⟩



Record views