相关论文: The convex hull for a random acceleration process …
We consider the nonconvex set $\mathcal S_n = \{(x,X,z): X = x x^T, \; x (1-z) =0,\; x \geq 0,\; z \in \{0,1\}^n\}$, which is closely related to the feasible region of several difficult nonconvex optimization problems such as the best…
We prove convex ordering results for random vectors admitting a predictable representation in terms of a Brownian motion and a non-necessarily independent jump component. Our method uses forward-backward stochastic calculus and extends…
We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…
We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…
In this paper we deal with problems concerning the volume of the convex hull of two "connecting" bodies. After a historical background we collect some results, methods and open problems, respectively.
For an $(n\ge 2)$-dimensional real Banach space $E$ with unit ball $E_{\le 1}$ and a topological space $X$ arbitrary elements in $C(X,E_{\le 1})$ are always expressible as linear combinations of at most three functions valued in the unit…
The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…
We study the convex hull membership (CHM) problem in the pure exploration setting where one aims to efficiently and accurately determine if a given point lies in the convex hull of means of a finite set of distributions. We give a complete…
We study the distribution of the area and perimeter of the convex hull of the "true" self-avoiding random walk in a plane. Using a Markov chain Monte Carlo sampling method, we obtain the distributions also in their far tails, down to…
In this paper, we cope with the following problem: compute the size of the convex hull of a configuration C, where the given data is the number of separating lines between any two points of the configuration (where the lines are generated…
We derive an exact equation governing two-particle backwards mean-squared dispersion for both deterministic and stochastic tracer particles in turbulent flows. For the deterministic trajectories, we probe the consequences of our formula for…
In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study,…
The calculation of the stress field around an arbitrarily shaped crack in an infinite two-dimensional elastic medium is a mathematically daunting problem. With the exception of few exactly soluble crack shapes the available results are…
An asymptotic formula is proved for the expected $T$-functional of the convex hull of independent and identically distributed random points sampled from the Euclidean unit sphere in $\mathbb{R}^n$ according to an arbitrary positive…
Several researchers have described two-part models with patient-specific stochastic processes for analysing longitudinal semicontinuous data. In theory, such models can offer greater flexibility than the standard two-part model with…
We study the random metric space called the Brownian plane, which is closely related to the Brownian map and is conjectured to be the universal scaling limit of many discrete random lattices such as the uniform infinite planar…
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
A geometric framework for metrics of maximal acceleration which is applicable to large proper accelerations is discussed, including a theory of connections associated with the geometry of maximal acceleration. In such a framework it is…