Related papers: Probability that n random points in a disk are in …
In the d dimensional Euclidean space, any set of n+1 independent random points, uniformly distributed in the interior of a unit ball of center O, determines almost surely a circumsphere of center C and of radius R, with n positive and less…
Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…
This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new…
Given a set $P$ of $n$ points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $S$ of $P$. The random subset $S$ is formed by drawing each…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…
This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general…
We consider the urn setting with two different objects, ``good'' and ``bad'', and analyze the number of draws without replacement until a good object is picked. Although the expected number of draws for this setting is a standard textbook…
Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…
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…
The curse of dimensionality is a common phenomenon which affects analysis of datasets characterized by large numbers of variables associated with each point. Problematic scenarios of this type frequently arise in classification algorithms…
Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…
We study a system of equal-sized circular discs each with an asymmetrically placed pivot at a fixed distance from the center. The pivots are fixed at the vertices of a regular triangular lattice. The discs can rotate freely about the…
Monodisperse circular disks have been collectively packed in confined geometries using a Monte Carlo method where the compaction is propelled by two- dimensional stochastic agitation. We have found that confinement (i.e., finite-size plus…
We consider the problem of navigation with safety constraints. The safety constraints are probabilistic, where a given set is assigned a degree of safety, a number between zero and one, with zero being safe and one being unsafe. The…
We consider procedures of sampling parts from a random integer partition. We determine asymptotically the probabilty distribution of the randomly-selected part whenever the positive integer that is partitioned becomes large.
In this paper, we propose new sequential randomized algorithms for convex optimization problems in the presence of uncertainty. A rigorous analysis of the theoretical properties of the solutions obtained by these algorithms, for full…
In this paper we study some conditional probabilities for the totally asymmetric simple exclusion processes (TASEP) with second class particles. To be more specific, we consider a finite system with one first class particle and $N-1$ second…