On the Stability of Community Detection Algorithms on Longitudinal Citation Data

Abstract

There are fundamental differences between citation networks and other classes of graphs. In particular, given that citation networks are directed and acyclic, methods developed primarily for use with undirected social network data may face obstacles. This is particularly true for the dynamic development of community structure in citation networks. Namely, it is neither clear when it is appropriate to employ existing community detection approaches nor is it clear how to choose among existing approaches. Using simulated data, we attempt to clarify the conditions under which one should use existing methods and which of these algorithms is appropriate in a given context. We hope this paper will serve as both a useful guidepost and an encouragement to those interested in the development of more targeted approaches for use with longitudinal citation data.

17 pages, 7 figures, presenting at Applications of Social Network Analysis 2009, ETH Zurich Edit, August 17, 2009: updated abstract, figures, text clarifications

References in corpus (11)

• Emergence of scaling in random networks
• Community structure in social and biological networks
• Fast algorithm for detecting community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Comparing community structure identification
• Quantifying social group evolution
• Community structure in directed networks
• Citation Networks in High Energy Physics
• Large-scale structure of time evolving citation networks
• Random acyclic networks
• Dynamical Clustering of Exchange Rates