89 citations · 113 across the 11 of their papers we have counts for
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2017★ 2 cited
Fast Approximate Spectral Clustering for Dynamic Networks
Lionel Martin, Andreas Loukas, Pierre Vandergheynst
Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past…
stat.ML2017
How close are the eigenvectors and eigenvalues of the sample and actual covariance matrices?
Andreas Loukas
How many samples are sufficient to guarantee that the eigenvectors and eigenvalues of the sample covariance matrix are close to those of the actual covariance matrix? For a wide fa…
stat.ML2016
Predicting the evolution of stationary graph signals
Andreas Loukas, Nathanael Perraudin
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Ne…