Searcharxiv⌕ Search

arXiv subjects

Ana Lucia Garcia-Pulido

Publications and source records attributed to Ana Lucia Garcia-Pulido.

4 recordsLinked to original sources

Bi-Lipschitz embeddings of the space of unordered $m$-tuples with a partial transportation metric

Let $Ω\subset \mathbb{R}^n$ be non-empty, open and proper. Consider $Wb(Ω)$, the space of finite Borel measures on $Ω$ equipped with the partial transportation metric introduced by Figalli and Gigli that allows the creation and destruction of mass on $\partial Ω$. Equivalently, we show that $Wb(Ω)$ is isometric to a subset of all Borel measures with the ordinary Wasserstein distance, on the one point completion of $Ω$ equipped with the shortcut metric \[δ(x,y)= \min\{\|x-y\|, \operatorname{dist}(x,\partial Ω)+\operatorname{dist}(y,\partialΩ)\}.\] In this article we construct bi-Lipschitz embeddings of the set of unordered $m$-tuples in $Wb(Ω)$ into Hilbert space. This generalises Almgren's bi-Lipschitz embedding theorem to the setting of optimal partial transport.

math.MG↗

Graph Pseudometrics from a Topological Point of View

We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has often been observed that phenomena exhibited by real-world networks reflect the topology of their flag complexes, as measured, for example, by Betti numbers or simplex counts. As it is often computationally expensive (or even unfeasible) to determine such topological features exactly, it would be extremely valuable to have pseudometrics on the set of directed graphs that can both detect the topological differences and be computed efficiently. To facilitate work in this direction, we introduce methods to measure how well a graph pseudometric captures the topology of a directed graph. We then use these methods to evaluate some well-established pseudometrics, using test data drawn from several families of random graphs.

math.AT↗