English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Given a graph $$G=(V,E)$$ G = ( V , E ) , suppose we are interested in selecting a sequence of vertices $$(x_j)_{j=1}^n$$ ( x j ) j = 1 n such that $$\left\{ x_1, \dots , x_k\right\} $$ 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. Peyre’s estimate in the continuous setting. We illustrate this with many examples and discuss several open problems.

Sequences of Well-Distributed Vertices on Graphs and Spectral Bounds on Optimal Transport