A fuzzy network jump model for clustering time-varying observations indexed by the nodes of a weighted graph that accurately recovers the true membership probabilities and outperforms competing clustering methods is introduced.
Abstract
We introduce a fuzzy network jump model for clustering time-varying observations indexed by the nodes of a weighted graph. The framework allows flexible graph representations with spatial and temporal regularization promoting smooth soft cluster assignments across connected nodes and consecutive time points. Estimation is performed through an efficient alternating optimization scheme that exploits the quadratic structure of the regularization terms. A simulation study covering different levels of spatial dependence and cluster overlap shows that the proposed method accurately recovers the true membership probabilities and outperforms competing clustering methods. An application to traffic-network data for the city of San Francisco identifies interpretable traffic regimes and reveals their evolution over time and across connected road segments.
The framework gives a nonparametric baseline for dynamic network analysis with explicit convergence guarantees and establishes nonparametric convergence rates in both block-model and Holder-smooth regimes.
It is established that spectral clustering of the sample covariance matrix achieves exact recovery of the underlying communities under a stochastic blockmodel even when the adjacency matrix is unobserved.
Brendan Martin, Joshua Agterberg, Mihai Cucuringu et al.· 0 citations
A spectral clustering approach, termed Spectral Clustering for Mixed Membership, based on an ideal cone structure of the variant for the eigendecomposition of the regularized Laplacian matrix is proposed, which shows the asymptotic consistency of the algorithm under mild assumptions by providing error bounds for the in...
Graph signal processing provides a powerful framework for analyzing data defined over irregular network structures. Estimation of effective models from a set of timevarying graph signals requires capturing both temporal dynamics and graph-dependent statistical structures. Existing approaches that model time-vertex sign...
Deniz Aslan, Elif Vural· Signal Processing and Commun...· 0 citations
By specifying a stochastically evolving hidden Markov network model, this work addresses two important directions for further investigation identified by Chang et al. (2022): robustness to non-identical network replicates, and efficient aggregation of multiple available network snapshots.
A generative model for temporal networks that jointly controls community evolution and dynamic node sets and is used as a benchmark to study the impact of the rate at which nodes join/leave the network on the performance of dynamic community detection algorithms.
Pei-Jie Zhong, Raul J. Mondragón, Richard G. Clegg· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
