Related papers: Expected Distances on Manifolds of Partially Orien…
Interior and exterior angle vectors of polytopes capture curvature information at faces of all dimensions and can be seen as metric variants of $f$-vectors. In this context, Gram's relation takes the place of the Euler--Poincar\'e relation…
The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
A flag domain of a real from $G_0$ of a complex semismiple Lie group $G$ is an open $G_0$-orbit $D$ in a (compact) $G$-flag manifold. In the usual way one reduces to the case where $G_0$ is simple. It is known that if $D$ possesses…
The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…
The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such…
Statistical graph models aim at modeling graphs as random realization among a set of possible graphs. One issue is to evaluate whether or not a graph is likely to have been generated by one particular model. In this paper we introduce the…
A flag area measure on an $n$-dimensional euclidean vector space is a continuous translation-invariant valuation with values in the space of signed measures on the flag manifold consisting of a unit vector $v$ and a $(p+1)$-dimensional…
We introduce an alternative formalization of curved spaces in which the concept of a pointwise affine space, as defined here, replaces that of a manifold. New or modified definitions of familiar notions from differential geometry such as…
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
We introduce a general framework allowing the systematic study of random manifolds. In order to do so, we will put ourselves in a more general context than usual by allowing the underlying probability space to be non commutative. We…
Tracking signals in dynamic environments presents difficulties in both analysis and implementation. In this work, we expand on a class of subspace tracking algorithms which utilize the Grassmann manifold -- the set of linear subspaces of a…
Let $X$ be a metric space and let $\mu$ be a probability measure on it. Consider a Lipschitz map $T: X \rightarrow \Rn$, with Lipschitz constant $\leq 1$. Then one can ask whether the image $TX$ can have large projections on many…
We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
The purpose of this article is to introduce projective geometry over composition algebras : the equivalent of projective spaces and Grassmannians over them are defined. It will follow from this definition that the projective spaces are in…
This paper prescribes a distance between learning tasks modeled as joint distributions on data and labels. Using tools in information geometry, the distance is defined to be the length of the shortest weight trajectory on a Riemannian…
Information geometry is a study of statistical manifolds, that is, spaces of probability distributions from a geometric perspective. Its classical information-theoretic applications relate to statistical concepts such as Fisher information,…
Despite high-dimensionality of images, the sets of images of 3D objects have long been hypothesized to form low-dimensional manifolds. What is the nature of such manifolds? How do they differ across objects and object classes? Answering…