Related papers: Sampling by Intersections with Random Geodesics
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…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
As a natural analog of Urysohn's inequality in Euclidean space, Gao, Hug, and Schneider showed in 2003 that in spherical or hyperbolic space, the total measure of totally geodesic hypersurfaces meeting a given convex body K is minimized…
Geometrical measurements of biological objects form the basis of many quantitative analyses. Hausdorff measures such as the volume and the area of objects are simple and popular descriptors of individual objects, however, for most…
Uniform probability distributions on $\ell_p$ balls and spheres have been studied extensively and are known to behave like product measures in high dimensions. In this note we consider the uniform distribution on the intersection of a…
Existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of random rotations of K and L is nicely bounded. For L = subspace, this main result immediately yields the unexpected phenomenon: "If…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
We obtain a new upper estimate on the Euclidean diameter of the intersection of the kernel of a random matrix with iid rows with a given convex body. The proof is based on a small-ball argument rather than on concentration and thus the…
We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard two-dimensional flat torus ("arithmetic random waves") with a fixed real-analytic reference curve with nonvanishing curvature. The…
We introduce a model for random geodesic drawings of the complete bipartite graph $K_{n,n}$ on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$, where we select the vertices in each bipartite class of $K_{n,n}$ with respect to two…
Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…
Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…
We present new algorithms to perform fast probabilistic collision queries between convex as well as non-convex objects. Our approach is applicable to general shapes, where one or more objects are represented using Gaussian probability…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…