相关论文: The convex hull for a random acceleration process …
We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…
Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in E3. This…
We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…
We study the convex hulls of trajectories of polynomial dynamical systems. Such trajectories include real algebraic curves. The boundaries of the resulting convex bodies are stratified into families of faces. We present numerical algorithms…
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a desired goal. We use the geometric amoebot model as our…
We study the problem of estimating the convex hull of the image $f(X)\subset\mathbb{R}^n$ of a compact set $X\subset\mathbb{R}^m$ with smooth boundary through a smooth function $f:\mathbb{R}^m\to\mathbb{R}^n$. Assuming that $f$ is a…
We give the first differentially private algorithms that estimate a variety of geometric features of points in the Euclidean space, such as diameter, width, volume of convex hull, min-bounding box, min-enclosing ball etc. Our work relies…
We study the effect of confinement on the mean perimeter of the convex hull of a planar Brownian motion, defined as the minimum convex polygon enclosing the trajectory. We use a minimal model where an infinite reflecting wall confines the…
This article is devoted to the study of the behaviour of a (1+1)-dimensional model of random walk conditioned to enclose an area of order $N^2$. Such a conditioning enforces a globally concave trajectory. We study the local deviations of…
A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…
In this paper, we study the limiting behavior of the perimeter and diameter functionals of the convex hull spanned by the first $n$ steps of two planar random walks. As the main results, we obtain the strong law of large numbers and the…
We study fully nonlinear geometric flows that deform strictly $k$-convex hypersurfaces in Euclidean space with pointwise normal speed given by a concave function of the principal curvatures. Specifically, the speeds we consider are obtained…
Motivated by renewed interest in the physics of branched polymers, we present here a complete characterization of the connectivity and spatial properties of $2$ and $3$-dimensional single-chain conformations of randomly branching polymers…
We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…
The statistical mechanics of polymer loops entangled in the two-dimensional array of randomly distributed obstacles of infinite length is discussed. The area of the loop projected to the plane perpendicular to the obstacles is used as a…
Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…
Lecture notes (in French) of a master 2 level course in applied mathematics. Contents: Part I. Markov chains on a countable space. 1. Examples 2. Summary of basic properties. 3. Spectral theory and speed of convergence. 4. Lyapunov…