Communities detection and the analysis of their dynamics in collaborative networks Online publication date: Sun, 22-Mar-2009
by Celine Robardet, Eric Fleury
International Journal of Web Based Communities (IJWBC), Vol. 5, No. 2, 2009
Abstract: The analysis of graphs like collaborative networks aims at studying the relationships between individuals, instead of individual attributes or properties. One of the interesting substructures of such a graph is a community structure, which is a subset of nodes that are more densely linked when compared with the rest of the network. Such dense subgraphs gather individuals who share similar interests depending on the type of relation encoded in the graph. In this paper we tackle the problem of identifying communities in dynamic networks. We propose an approach based on the random walk to identify communities in evolving graphs like collaborative networks. We apply this approach to the Infocom co-authorship network to determine stable collaborations and evolving communities. We use such information, combined with other Digital Bibliography & Library Project (DBLP) co-authorship network topology features, to analyse the formation of the programme committee board of a conference.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Based Communities (IJWBC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook