DeepAI AI Chat
Log In Sign Up

Smoothing complex-valued signals on Graphs with Monte-Carlo

10/15/2022
by   Hugo Jaquard, et al.
0

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 cycle. We provide a Julia implementation of these estimators and study their performance when applied to a ranking problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/17/2019

Smoothing graph signals via random spanning forests

Another facet of the elegant link between random processes on graphs and...
02/05/2019

Unbiased Smoothing using Particle Independent Metropolis-Hastings

We consider the approximation of expectations with respect to the distri...
07/06/2018

Resample-smoothing of Voronoi intensity estimators

Voronoi intensity estimators, which are non-parametric estimators for in...
12/04/2020

On the Optimization of Approximate Control Variates with Parametrically Defined Estimators

Multi-model Monte Carlo methods, such as multi-level Monte Carlo (MLMC) ...
10/28/2021

Living on the Edge: An Unified Approach to Antithetic Sampling

We identify recurrent ingredients in the antithetic sampling literature ...
03/16/2022

On estimating the structure factor of a point process, with applications to hyperuniformity

Hyperuniformity is the study of stationary point processes with a sub-Po...
07/15/2020

A family of metrics from the truncated smoothing of Reeb graphs

In this paper, we introduce an extension of smoothing on Reeb graphs, wh...