Graph sampling with determinantal processes - CICS Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Graph sampling with determinantal processes

Résumé

We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, i.e., in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, i.e., in cases where the graph's spectrum is not accessible, we investigate, both theoretically and empirically, a sub-optimal but much faster DPP based on loop-erased random walks on the graph. Preliminary experiments show promising results especially in cases where the number of measurements should stay as small as possible and for graphs that have a strong community structure. Our sampling scheme is efficient and can be applied to graphs with up to 10^6 nodes.
Fichier principal
Vignette du fichier
paper.pdf (418.6 Ko) Télécharger le fichier
results_EUSIPCO_N=100_comnum=2_K=2_known_Uk_sigma=0p0001_with_EB.pdf (146.49 Ko) Télécharger le fichier
results_EUSIPCO_N=100_comnum=2_K=2_unknown_Uk_sigma=0p0001_gmres=True_est_weights=True_vs_EASINESS.pdf (97.81 Ko) Télécharger le fichier
results_EUSIPCO_N=100_comnum=2_K=2_unknown_Uk_sigma=0p0001_gmres=True_est_weights=True_vs_gamma.pdf (97.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01483347 , version 1 (05-03-2017)

Identifiants

Citer

Nicolas Tremblay, Pierre-Olivier Amblard, Simon Barthelme. Graph sampling with determinantal processes. EUSIPCO 2017 - 25th European Signal Processing Conference, Aug 2017, Kos Island, Greece. ⟨10.23919/EUSIPCO.2017.8081494⟩. ⟨hal-01483347⟩
420 Consultations
246 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More