Related papers: Approximating geodesics via random points
Let $\Omega$ be a connected open set in the plane and $\gamma: [0,1] \to \overline{\Omega}$ a path such that $\gamma((0,1)) \subset \Omega$. We show that the path $\gamma$ can be ``pulled tight'' to a unique shortest path which is homotopic…
Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…
Conformal geodesics are distinguished curves on a conformal manifold, loosely analogous to geodesics of Riemannian geometry. One definition of them is as solutions to a third order differential equation determined by the conformal…
Random fields are mathematical structures used to model the spatial interaction of random variables along time, with applications ranging from statistical physics and thermodynamics to system's biology and the simulation of complex systems.…
We study symmetric motifs in random geometric graphs. Symmetric motifs are subsets of nodes which have the same adjacencies. These subgraphs are particularly prevalent in random geometric graphs and appear in the Laplacian and adjacency…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
We introduce a framework to derive quantitative central limit theorems in the context of non-linear approximation of Gaussian random variables taking values in a separable Hilbert space. In particular, our method provides an alternative to…
In this paper, we study the computational complexity of finding the \emph{geodetic number} of graphs. A set of vertices $S$ of a graph $G$ is a \emph{geodetic set} if any vertex of $G$ lies in some shortest path between some pair of…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…
In this work, we are concerned with the decentralized optimization problem: \begin{equation*} \min_{x \in \Omega}~f(x) = \frac{1}{n} \sum_{i=1}^n f_i (x), \end{equation*} where $\Omega \subset \mathbb{R}^d$ is a convex domain and each $f_i…
We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…
In this chapter, we give an overview of part of our previous work based on the minimal path framework and the Eikonal partial differential equation (PDE). We show that by designing adequate Riemannian and Randers geodesic metrics the…
We are interested in the cost-convex potentials in optimal mass transport theory, and we show by direct and geometric arguments the equivalence between cost-subdifferentials and ordinary subdifferentials of cost-convex functions, under the…
Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very…
We study the problem of approximating the value of the matching polynomial on graphs with edge parameter $\gamma$, where $\gamma$ takes arbitrary values in the complex plane. When $\gamma$ is a positive real, Jerrum and Sinclair showed that…
We analyse the numbers of closed paths of length $k\in\mathbb{N}$ on two important regular lattices: the hexagonal lattice (also called $\textit{graphene}$ in chemistry) and its dual triangular lattice. These numbers form a moment sequence…
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…
A connected graph is called \emph{geodetic} if there is a unique shortest path between each pair of vertices. We introduce a systematic method for constructing new presentations of free products that give rise to previously unknown geodetic…
We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and…
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. We…