If n points are sampled independently from an absolutely contin-uous distribution with support a convex subset of <2, then the center and radius of the ball determined by the bounding median lines (the LP yolk) converge with probability one to the center and radius of the yolk. The linear program of [9] is therefore an effective heuristic for computing the yolk in large samples. This result partially explains the results of numerical experiments in [8], where the bounding median lines always produced a radius within 2 % of the yolk radius
Suppose that a homogeneous system of spherical particles (d-spheres) with independent identically di...
ABSTRACT. – We suggest a generalisation of the convex-hull method, or ‘DEA ’ approach, for estimatin...
AbstractLet K be a convex body in Rd and let Xn=(x1,…,xn) be a random sample of n independent points...
If n points are sampled independently from an absolutely continuous distribution with support a con...
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key con...
The yolk is an important concept in spatial voting games: the yolk center generalises the equilibriu...
We prove a limit theorem for the maximum interpoint distance (also called the diameter) for a sample...
AbstractWe study properties of polytopes circumscribed by a unit sphere in Rn with either m extreme ...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
Let S be a set of n points in R d. The \roundness " of S can be measured by computing the width...
We study a variant of the median problem for a collection of point sets in high dimensions. This gen...
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently s...
We suggest a generalisation of the convex-hull method, or 'DEA' approach, for estimating the boundar...
International audiencePoincaré inequalities are ubiquitous in probability and analysis and have vari...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Suppose that a homogeneous system of spherical particles (d-spheres) with independent identically di...
ABSTRACT. – We suggest a generalisation of the convex-hull method, or ‘DEA ’ approach, for estimatin...
AbstractLet K be a convex body in Rd and let Xn=(x1,…,xn) be a random sample of n independent points...
If n points are sampled independently from an absolutely continuous distribution with support a con...
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key con...
The yolk is an important concept in spatial voting games: the yolk center generalises the equilibriu...
We prove a limit theorem for the maximum interpoint distance (also called the diameter) for a sample...
AbstractWe study properties of polytopes circumscribed by a unit sphere in Rn with either m extreme ...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
Let S be a set of n points in R d. The \roundness " of S can be measured by computing the width...
We study a variant of the median problem for a collection of point sets in high dimensions. This gen...
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently s...
We suggest a generalisation of the convex-hull method, or 'DEA' approach, for estimating the boundar...
International audiencePoincaré inequalities are ubiquitous in probability and analysis and have vari...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Suppose that a homogeneous system of spherical particles (d-spheres) with independent identically di...
ABSTRACT. – We suggest a generalisation of the convex-hull method, or ‘DEA ’ approach, for estimatin...
AbstractLet K be a convex body in Rd and let Xn=(x1,…,xn) be a random sample of n independent points...
Add to ORKG