Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport

08/25/2020
by   Louis Brown, et al.
0

Given a graph G=(V,E), suppose we are interested in selecting a sequence of vertices (x_j)_j=1^n such that {x_1, …, x_k} is `well-distributed' uniformly in k. We describe a greedy algorithm motivated by potential theory and corresponding developments in the continuous setting. The algorithm performs nicely on graphs and may be of use for sampling problems. We can interpret the algorithm as trying to greedily minimize a negative Sobolev norm; we explain why this is related to Wasserstein distance by establishing a purely spectral bound on the Wasserstein distance on graphs that mirrors R. Peyré's estimate in the continuous setting. We illustrate this with many examples and discuss several open problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2023

Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks

Comparing graphs by means of optimal transport has recently gained signi...
research
03/24/2023

Optimal transport and Wasserstein distances for causal models

In this paper we introduce a variant of optimal transport adapted to the...
research
12/07/2020

The Spectral-Domain 𝒲_2 Wasserstein Distance for Elliptical Processes and the Spectral-Domain Gelbrich Bound

In this short note, we introduce the spectral-domain 𝒲_2 Wasserstein dis...
research
10/06/2021

A Regularized Wasserstein Framework for Graph Kernels

We propose a learning framework for graph kernels, which is theoreticall...
research
09/19/2019

On the Wasserstein Distance between Classical Sequences and the Lebesgue Measure

We discuss the classical problem of measuring the regularity of distribu...
research
02/13/2019

Wasserstein Barycenter Model Ensembling

In this paper we propose to perform model ensembling in a multiclass or ...
research
09/30/2018

Convergence and perturbation theory for an infinite-dimensional Metropolis-Hastings algorithm with self-decomposable priors

We study a Metropolis-Hastings algorithm for target measures that are ab...

Please sign up or login with your details

Forgot password? Click here to reset