Related papers: Buffon Needle Problem Over Convex Sets

Let $\Cant_n$ be the $n$-th generation in the construction of the middle-half Cantor set. The Cartesian square $\K_n$ of $\Cant_n$ consists of $4^n$ squares of side-length $4^{-n}$. The chance that a long needle thrown at random in the unit…

Let $\Cant_n$ be the $n$-th generation in the construction of the middle-half Cantor set. The Cartesian square $\K_n = \Cant_n \times \Cant_n$ consists of $4^n$ squares of side-length $4^{-n}$. The chance that a long needle thrown at random…

In this paper we get an estimate of Favard length of an arbitrary neighbourhood of an arbitrary self-similar Cantor set. Consider $L$ closed disjoint discs of radius $1/L$ inside the unit disc. By using linear maps of smaller disc onto the…

We review the well known Bertrand paradoxes, and we first maintain that they do not point to any probabilistic inconsistency, but rather to the risks incurred with a careless use of the locution "at random". We claim then that these…

The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…

For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…

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…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

If you throw a needle or stick at random onto a floor ruled with parallel lines, such as the cracks between floorboards or tiles, from the proportion of times that the stick lands crossing a crack you can estimate $\pi$; can we get $e$ as…

In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…

In a general simulation of random walking (with the angle of motion picked uniformly), it can be seen that the probability of crossing a WiFi TX-RX link is directly proportional to the per-step distance and inversely proportional to the…

In this paper, we study the Favard length of some random Cantor sets of Hausdorff dimension 1. We start with a unit disk in the plane and replace the unit disk by $4$ disjoint subdisks (with equal distance to each other) of radius $1/4$…

Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length $L$ in a convex body can match the Crofton-predicted line-intersection counts, and proved an $O\left(L^{1/3}\right)$ upper bound…

Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…

The classical theorem of Wendel provides an exact formula for the probability that the convex hull of independent symmetrically distributed vectors in ${\mathbb R}^d$ contains the origin as long as the distributions of the vectors are…

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…