By Topic

Analyzing collaboration networks using simplicial complexes: A case study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Moore, T.J. ; U.S. Army Res. Lab., Adelphi, MD, USA ; Drost, R.J. ; Basu, P. ; Ramanathan, R.
more authors

Collaboration social networks are traditionally modeled using graphs that capture pairwise relationships but have ambiguity between group collaborations and multiple pairwise collaborations. We present a new approach to analyzing collaboration networks using simplicial complexes to represent the co-authorship collaborations. We formally define several key novel metrics: 1) higher dimensional analogs of vertex degree (e.g., simplex and facet degrees), 2) homology, and 3) minimal non-faces; and discuss their interpretation as it relates to co-authorship. We use these metrics in a study of an Army Research Lab dataset that includes the publications of the Communications & Networks Collaborative Technology Alliance. In particular, our study reveals many properties of large networks mirrored by this single-program publication dataset: the distinction of certain simplex degrees from vertex degrees, a power law characteristic in facet degrees, and some properties of topological “holes” and minimal non-faces.

Published in:

Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on

Date of Conference:

25-30 March 2012