Community Detection In Networks Without Observing Edges

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.

@article{
    Hoffmann2020,
    title = "Community Detection In Networks Without Observing Edges",
    author = "Hoffmann, Till and Peel, Leto and Lambiotte, Renaud and Jones, Nick S.",
    journal = "Science Advances",
    year = "2020",
    volume = "6",
    number = "4",
    doi = "10.1126/sciadv.aav1478",
    pages = "eaav1478",
}