Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-12T16:22:52.513Z Has data issue: false hasContentIssue false

Clustering ensembles of social networks

Published online by Cambridge University Press:  15 April 2019

Tracy M. Sweet*
Affiliation:
Department of Human Development and Quantitative MethodologyUniversity of Maryland College Park, MD, USA
Abby Flynt
Affiliation:
Department of MathematicsBucknell University Lewisburg, PA, USA
David Choi
Affiliation:
Heinz College Carnegie Mellon University Pittsburgh, PA, USA
*
*Corresponding author. Email: tsweet@umd.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Recently there has been significant work in the social sciences involving ensembles of social networks, that is, multiple, independent, social networks such as students within schools or employees within organizations. There remains, however, very little methodological work on exploring these types of data structures. We present methods for clustering social networks with observed nodal class labels, based on statistics of walk counts between the nodal classes. We extend this method to consider only non-backtracking walks, and introduce a method for normalizing the counts of long walk sequences using those of shorter ones. We then present a method for clustering networks based on these statistics to explore similarities among networks. We demonstrate the utility of this method on simulated network data, as well as on advice-seeking networks in education.

Information

Type
Original Article
Copyright
© Cambridge University Press 2019