相关论文: Volume Approximation of Strongly ${\mathbb C}$-Con…

Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random…

We derive an a priori error estimate for the numerical solution obtained by time and space discretization by the finite volume/finite element method of the barotropic Navier--Stokes equations. The numerical solution on a convenient…

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

We estimate the support of a uniform density, when it is assumed to be a convex polytope or, more generally, a convex body in $\R^d$. In the polytopal case, we construct an estimator achieving a rate which does not depend on the dimension…

H. Guggenheimer generalized the planar volume product problem for locally convex curves $C$ enclosing the origin $k \ge 2$ times. He conjectured that the minimal volume product $V(C)V(C^*)$ for these curves is attained if the curve consists…

Many real phenomena may be modelled as random closed sets in $\mathbb{R}^d$, of different Hausdorff dimensions. In many real applications, such as fiber processes and $n$-facets of random tessellations of dimension $n\leq d$ in spaces of…

Let $\Omega$ be a bounded closed convex set in ${\mathbb R}^d$ with non-empty interior, and let ${\cal C}_r(\Omega)$ be the class of convex functions on $\Omega$ with $L^r$-norm bounded by $1$. We obtain sharp estimates of the…

Sampling from high dimensional distributions and volume approximation of convex bodies are fundamental operations that appear in optimization, finance, engineering, artificial intelligence and machine learning. In this paper we present…

This paper develops the large deviations theory for the point process associated with the Euclidean volume of $k$-nearest neighbor balls centered around the points of a homogeneous Poisson or a binomial point processes in the unit cube. Two…

Volume is a natural geometric measure for comparing polyhedral relaxations of non-convex sets. Speakman and Lee gave volume formulae for comparing relaxations of trilinear monomials, quantifying the strength of various natural relaxations.…

New selected values of odd random simplex volumetric moments (moments of the volume of a random simplex picked from a given body) are derived in an exact form in various bodies in dimensions three, four, five, and six. In three dimensions,…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…

Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…

Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on the data sets to reduce their dimensionality. In some…

For any integers $n\geq 2$ and $1\leq r\leq n-1$ satisfying $3r\geq 2n-1$, we show that the expected volume fraction of a random degree $d$ complex submanifold of $\C\mathbb{P}^n$ of codimension $r$ where the bisectional holomorphic…

We establish a weighted $L^p$ norm estimate for the Bergman projection for a class of pseudoconvex domains. We obtain an upper bound for the weighted $L^p$ norm when the domain is, for example, a bounded smooth strictly pseudoconvex domain,…

Over the last decade, approximating functions in infinite dimensions from samples has gained increasing attention in computational science and engineering, especially in computational uncertainty quantification. This is primarily due to the…

We are interested in the optimization of convex domains under a PDE constraint. Due to the difficulties of approximating convex domains in $\mathbb{R}^3$, the restriction to rotationally symmetric domains is used to reduce shape…

We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…