5 accepted papers
Discrete Determinantal Point Processes (DPPs) have a wide array of potential applications for subsampling datasets. They are however held back in some cases by the high cost of sampling. In the worst-case scenario, the sampling cost scales as $O(n^3)$ where n is the number of elements of the ground…
We introduce new smoothing estimators for complex signals on graphs, based on a recently studied Determinantal Point Process (DPP). These estimators are built from subsets of edges and nodes drawn according to this DPP, making up trees and unicycles, i.e., connected components containing exactly one…
Another facet of the elegant link between random processes on graphs and Laplacian-based numerical linear algebra is uncovered: based on random spanning forests, novel Monte-Carlo estimators for graph signal smoothing are proposed. These random forests are sampled efficiently via a variant of Wilson…
A difficult aspect of multimodal estimation is the possible discrepancy between the sampling rates and/or the noise levels of the considered data. Many algorithms cope with these dissimilarities empirically. In this paper, we propose a conceptual analysis of multimodality where we try to find the "o…
In this study we use the crossing tree of a signal for the purpose of analysis of H-sssi processes. The crossing tree performs an ad-hoc decomposition of a signal adapted to its dynamics, and represents a natural tool for the analysis of its local fluctuations. We present here a new multifractal for…