Related papers: Closure of Random samples

Theoretical results for importance sampling rely on the existence of certain moments of the importance weights, which are the ratios between the proposal and target densities. In particular, a finite variance ensures square root convergence…

Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If $S$ is a set of $n$ points in $R^d$, we say that $S$ is $(k,G)$-clusterable if it can be partitioned into…

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

This paper provides a construction of an uncountable family of i.i.d. random vectors, indexed by the points of a nonatomic measure space, such that (a) a sample is a measurable function from the index space, and (b) an idealization of the…

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

Position probability distribution of a set of massive mutually exclusive particles in one dimension has been defined. Examples with a given two mutually exclusive particles system are considered. It is emphasized that quantum particles at…

We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…

The notion of probability density for a random function is not as straightforward as in finite-dimensional cases. While a probability density function generally does not exist for functional data, we show that it is possible to develop the…

Mean density of lower dimensional random closed sets, as well as the mean boundary density of full dimensional random sets, and their estimation are of great interest in many real applications. Only partial results are available so far in…

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…

Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…

The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning…

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

We introduce $k$-variance, a generalization of variance built on the machinery of random bipartite matchings. $K$-variance measures the expected cost of matching two sets of $k$ samples from a distribution to each other, capturing local…

We consider the quantum expectation value \mathcal{A}=\<\psi|A|\psi\> of an observable A over the state |\psi\> . We derive the exact probability distribution of \mathcal{A} seen as a random variable when |\psi\> varies over the set of all…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

In $K$-means classification, a set of data will form clusters, i.e. classes, if the measured distances between data points (or some common point in each class) are below a certain threshold. With the assumption that the data points are…

It is shown that the correlation functions of the random variables $\det(\lambda - X)$, in which $X$ is a real symmetric $ N\times N$ random matrix, exhibit universal local statistics in the large $N$ limit. The derivation relies on an…