Related papers: An estimation of Hempel distance by using Reeb gra…
The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…
We introduce an estimator for distances in a compact Riemannian manifold based on graph Laplacian estimates of the Laplace-Beltrami operator. We upper bound the error in the estimate of manifold distances, or more precisely an estimate of a…
We obtain essentially matching upper and lower bounds for the expected max-sliced 1-Wasserstein distance between a probability measure on a separable Hilbert space and its empirical distribution from $n$ samples. By proving a Banach space…
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…
Let $M$ be a closed Riemannian manifold and let $X\subseteq M$. If the sample $X$ is sufficiently dense relative to the curvature of $M$, then the Gromov-Hausdorff distance between $X$ and $M$ is bounded from below by half their Hausdorff…
In this paper, we introduce a new concept of {\it strongly keen} for Heegaard splittings, and show that, for any integers $n\geq 2$ and $g\geq 3$, there exists a strongly keen Heegaard splitting of genus $g$ whose Hempel distance is $n$.
Let $p$ be a real number greater than one and let $\Gamma$ be a connected graph of bounded degree. We show that the $p$-Royden boundary of $\Gamma$ with the $p$-harmonic boundary removed is a $F_{\sigma}$-set. We also characterize the…
We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…
Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…
The Kullback-Leibler divergence, the Kullback-Leibler variation, and the Bernstein "norm" are used to quantify discrepancies among probability distributions in likelihood models such as nonparametric maximum likelihood and nonparametric…
Suppose N is a compressible boundary component of a compact orientable irreducible 3-manifold M and Q is an orientable properly embedded essential surface in M in which each component is incident to N and no component is a disk. Let VN and…
In this paper we prove new explicit formulas for Faltings' $\delta$-invariant of an arbitrary hyperelliptic Riemann surface. This has several applications: For example we obtain an explicit lower bound for $\delta$ depending only on the…
Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…
In this paper, we generalize the results of ($\textit{Groups, Geom. Dyn.}$, forthcoming) to describe the split left-invariant Riemannian distances on higher-rank Sol-type groups $G=\mathbf{N}\rtimes \mathbb{R}^k$. We show that the rough…
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…
The goal of this paper is to set up the general framework of higher-dimensional Heegaard Floer homology, define the contact class, and use it to give an obstruction to the Liouville fillability of a contact manifold and a sufficient…
In this paper we study variations of the Hopf theorem concerning continuous maps $f$ of a compact Riemannian manifold $M$ of dimension $n$ to $\mathbb{R}^n$. We investigate the case when $M$ is a closed convex $n$-dimensional surface and…
This paper investigates the Fr\'echet mean of the Erd\H{o}s-R\'enyi random graph $G_{n,p}$ with respect to the Frobenius distance on graph Laplacians, a metric that captures global structural information beyond local edge flips. We first…
Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable…
We present a new proof of Reidemeister and Singer's Theorem that any two Heegaard splittings of the same 3-manifold have a common stabilization. The proof leads to an upper bound on the minimal genus of a common stabilization in terms of…