Community detection in networks without observing edges

41Citations
Citations of this article
78Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We develop a Bayesian hierarchical model to identify communities of time series. 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 and 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 and climate data from U.S. cities.

Cite

CITATION STYLE

APA

Hoffmann, T., Peel, L., Lambiotte, R., & Jones, N. S. (2020). Community detection in networks without observing edges. Science Advances, 6(4). https://doi.org/10.1126/sciadv.aav1478

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free