Related papers: Probability that n random points in a disk are in …
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
We have discovered that two significant quantities within hard particle systems: the probability of successfully inserting an additional particle at random and the scale distribution function, can be connected by a concise relation. We…
In this paper we consider the plane elliptic motion which occurs if the moving centrode is a circle of radius $r$ and the fixed centrode a circle of radius $2r$. Every point of the moving plane generates an ellipse in the fixed plane. Let a…
Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull…
In the open circular billiard particles are placed initially with a uniform distribution in their positions inside a planar circular vesicle. They all have velocities of the same magnitude, whose initial directions are also uniformly…
Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…
New results on uniform convergence in probability for expansions of Gaussian random processes using compactly supported wavelets are given. The main result is valid for general classes of nonstationary processes. An application of the…
The data of a physical experiment can be represented as a presheaf of probability distributions. A striking feature of quantum theory is that those probability distributions obtained in quantum mechanical experiments do not always admit a…
We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.
For a one-dimensional L\'{e}vy process, we derive an explicit formula for the probability of first hitting a specified point among a fixed finite set. Moreover, using this formula, we obtain an explicit expression for each entry of the…
We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…
We consider $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice…
We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…
In this paper, we determine the radius of uniform convexity for three kinds of normalized Bessel functions of the first kind. In the mentioned cases the normalized Bessel functions are uniformly convex on the determined disks. Moreover,…
Unbiased random vectors i.e. distributed uniformly in n-dimensional space, are widely applied and the computational cost of generating a vector increases only linearly with n. On the other hand, generating uniformly distributed random…
The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of $n$ independent standard normally distributed points in $\mathbb R^d$. We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
In this paper, we derive formulas for the analytical calculation of the moments of the distance between two uniformly and independently distributed random points in an $n$-sided regular polygon. A number of closed form expressions is…
Consider a random simplex $[X_1,\ldots,X_n]$ defined as the convex hull of independent identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^{n-1}$ with the following beta density: $$ f_{n-1,\beta} (x) \propto…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…