Related papers: Sampling by Intersections with Random Geodesics
We consider random Gaussian eigenfunctions of the Laplacian on the three-dimensional flat torus, and investigate the number of nodal intersections against a straight line segment. The expected intersection number, against any smooth curve,…
In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…
Given the ensemble of random Gaussian Laplace eigenfunctions on the three-dimensional torus (`3d arithmetic random waves'), we investigate the $1$-dimensional Hausdorff measure of the nodal intersection curve against a compact regular toral…
Several years ago the authors started looking at some problems of convex geometry from a more general point of view, replacing volume by an arbitrary measure. This approach led to new general properties of the Radon transform on convex…
We consider random Gaussian eigenfunctions of the Laplacian on the standard torus, and investigate the number of nodal intersections against a line segment. The expected intersection number, against any smooth curve, is universally…
We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure (`length') of nodal intersections against a smooth 2-dimensional toral sub-manifold (`surface'). The…
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…
In this work we study a class of random convex sets that "interpolate" between polytopes and zonotopes. These sets arise from considering a $q^{th}$-moment ($q\geq 1$) of an average of order statistics of $1$-dimensional marginals of a…
When a rigid rough solid slides on a rigid rough surface, it experiences a random motion in the direction normal to the average contact plane. Here, through simulations of the separation at single-point contact between self-affine…
Intersection bodies represent a remarkable class of geometric objects associated with sections of star bodies and invoking Radon transforms, generalized cosine transforms, and the relevant Fourier analysis. The main focus of this article is…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
Motivated by numerous questions in random geometry, given a smooth manifold $M$, we approach a systematic study of the differential topology of Gaussian random fields (GRF) $X:M\to \mathbb{R}^k$, that we interpret as random variables with…
The purpose of this note is to present several aspects of concentration phenomena in high dimensional geometry. At the heart of the study is a geometric analysis point of view coming from the theory of high dimensional convex bodies. The…
We consider an extremal problem for subsets of high-dimensional spheres that can be thought of as an extension of the classical isoperimetric problem on the sphere. Let $A$ be a subset of the $(m-1)$-dimensional sphere $\mathbb{S}^{m-1}$,…
We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard three-dimensional flat torus with a fixed smooth reference curve, which has nowhere vanishing curvature. The expected intersection…
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…
The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…