Comparing Community Structure to Characteristics in Online Collegiate Social Networks

Abstract

We study the structure of social networks of students by examining the graphs of Facebook "friendships" at five American universities at a single point in time. We investigate each single-institution network's community structure and employ graphical and quantitative tools, including standardized pair-counting methods, to measure the correlations between the network communities and a set of self-identified user characteristics (residence, class year, major, and high school). We review the basic properties and statistics of the pair-counting indices employed and recall, in simplified notation, a useful analytical formula for the z-score of the Rand coefficient. Our study illustrates how to examine different instances of social networks constructed in similar environments, emphasizes the array of social forces that combine to form "communities," and leads to comparative observations about online social lives that can be used to infer comparisons about offline social structures. In our illustration of this methodology, we calculate the relative contributions of different characteristics to the community structure of individual universities and subsequently compare these relative contributions at different universities, measuring for example the importance of common high school affiliation to large state universities and the varying degrees of influence common major can have on the social structure at different universities. The heterogeneity of communities that we observe indicates that these networks typically have multiple organizing factors rather than a single dominant one.

Version 3 (17 pages, 5 multi-part figures), accepted in SIAM Review

References in corpus (8)

• Community detection in graphs
• Natural Scales in Geographical Patterns
• Finding community structure in networks using the eigenvectors of matrices
• Structure and tie strengths in mobile communication networks
• Robustness of community structure in networks
• Community Structure in Congressional Cosponsorship Networks
• The unreasonable effectiveness of tree-based theory for networks with clustering
• Community structure and ethnic preferences in school friendship networks

Cited by in corpus (52)

• Community detection in networks: A user guide
• Social Structure of Facebook Networks
• Robust Detection of Dynamic Community Structure in Networks
• Community detection in node-attributed social networks: a survey
• Dynamic fluctuations coincide with periods of high and low modularity in resting-state functional brain networks
• Causal Network Inference by Optimal Causation Entropy
• Multiscale and multimodal network dynamics underpinning working memory
• Evolutionary dynamics with game transitions
• Accuracy of Mean-Field Theory for Dynamics on Real-World Networks
• Influence of Neighborhood SES on Functional Brain Network Development
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• Extraction of Force-Chain Network Architecture in Granular Materials Using Community Detection
• Element-centric clustering comparison unifies overlaps and hierarchy
• A Large-Scale Community Structure Analysis In Facebook
• Multi-Stage Complex Contagions
• Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths
• Communities and bottlenecks: Trees and treelike networks have high modularity
• Opinion formation and distribution in a bounded confidence model on various networks
• Community Structure in the United Nations General Assembly
• Community detection with node attributes in multilayer networks
• Subsampling bootstrap of count features of networks
• Dynamics on Modular Networks with Heterogeneous Correlations
• Post-processing partitions to identify domains of modularity optimization
• A testing based extraction algorithm for identifying significant communities in networks
• Assembling thefacebook: Using heterogeneity to understand online social network assembly
• Persistent Homology Guided Force-Directed Graph Layouts
• Stochastic block model and exploratory analysis in signed networks
• Versatility of nodal affiliation to communities
• Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case
• Blind identification of stochastic block models from dynamical observations
• Synchronization over $Z_2$ and community detection in multiplex signed networks with constraints
• Community detection in networks via nonlinear modularity eigenvectors
• Moral foundations in an interacting neural networks society
• Message-Passing Methods for Complex Contagions
• Identifying Influential Spreaders of Epidemics on Community Networks
• Interplay between $k$-core and community structure in complex networks
• Improvements on SCORE, Especially for Weak Signals
• Complex Contagions with Timers
• Confidence sets for network structure
• Efficiently Detecting Overlapping Communities through Seeding and Semi-Supervised Learning
• Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection
• Comparing Community-aware Centrality Measures in Online Social Networks
• Geosocial Graph-Based Community Detection
• Grounding force-directed network layouts with latent space models
• Stochastic Block Models are a Discrete Surface Tension
• Influence Maximization: Divide and Conquer
• Extraction of Multi-layered Social Networks from Activity Data
• SCOREH+: A High-Order Node Proximity Spectral Clustering on Ratios-of-Eigenvectors Algorithm for Community Detection
• Algorithmic Fairness Datasets: the Story so Far
• Modelling the spillover from online engagement to offline protest: stochastic dynamics and mean-field approximations on networks
• Block-corrected Modularity for Community Detection
• Universal scaling hypothesis of quantum spatial search in complex networks