Community detection in networks without observing edges

Abstract

We develop a Bayesian hierarchical model to identify communities in networks for which we do not observe the edges directly, but instead observe a series of interdependent signals for each of the nodes. Fitting the model provides an end-to-end community detection algorithm that does not extract information as a sequence of point estimates but propagates uncertainties from the raw data to the community labels. Our approach naturally supports multiscale community detection as well as the selection of an optimal scale using model comparison. We study the properties of the algorithm using synthetic data and apply it to daily returns of constituents of the S&P100 index as well as climate data from US cities.

arXiv comment16 pages, 7 figures

References in corpus (14)

• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Maps of random walks on complex networks reveal community structure
• Variational Inference: A Review for Statisticians
• Statistical Mechanics of Community Detection
• Hierarchical modularity in human brain functional networks
• The backbone of the climate network
• The ground truth about metadata and community detection in networks
• Phase transition in the detection of modules in sparse networks
• Detectability thresholds and optimal algorithms for community structure in dynamic networks
• Temporal Evolution of Financial Market Correlations
• Enhanced detectability of community structure in multilayer networks through layer aggregation
• Dynamic communities in multichannel data: An application to the foreign exchange market during the 2007--2008 credit crisis

Cited by in corpus (9)

• Network reconstruction and community detection from dynamics
• Local dominance unveils clusters in networks
• Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
• Tackling the subsampling problem to infer collective properties from limited data
• Blind identification of stochastic block models from dynamical observations
• Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis
• Blind Inference of Eigenvector Centrality Rankings
• Generative model for reciprocity and community detection in networks
• Measuring topological descriptors of complex networks under uncertainty