83 citations · 332 across the 27 of their papers we have counts for
5 papers · 1 filter
Graph Tikhonov Regularization and Interpolation via Random Spanning Forests
Yusuf Pilavci, Pierre-Olivier Amblard, Simon Barthelme +1
Novel Monte Carlo estimators are proposed to solve both the Tikhonov regularization (TR) and the interpolation problems on graphs. These estimators are based on random spanning for…
Fast Graph Kernel with Optical Random Features
Hashem Ghanem, Nicolas Keriven, Nicolas Tremblay
The graphlet kernel is a classical method in graph classification. It however suffers from a high computation cost due to the isomorphism test it includes. As a generic proxy, and…
Determinantal Point Processes in the Flat Limit: Extended L-ensembles, Partial-Projection DPPs and Universality Classes
Simon Barthelmé, Nicolas Tremblay, Konstantin Usevich +1
Determinantal point processes (DPPs) are repulsive point processes where the interaction between points depends on the determinant of a positive-semi definite matrix. The contribut…
Community detection in sparse time-evolving graphs with a dynamical Bethe-Hessian
Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay
This article considers the problem of community detection in sparse dynamical graphs in which the community structure evolves over time. A fast spectral algorithm based on an exten…
A unified framework for spectral clustering in sparse graphs
Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay
This article considers spectral community detection in the regime of sparse networks with heterogeneous degree distributions, for which we devise an algorithm to efficiently retrie…