Related papers: Buffon's problem with a star of needles and a latt…
In 1974, Stoka solved Buffon's needle problem in $\mathbb{R}^d$, $d \ge 2$, i.e. he found a closed form solution for the probability that a line segment ("needle") with length $\ell$ intersects a grid of parallel hyperplanes with mutual…
We solve a variant of the classical Buffon Needle problem. More specifically, we inspect the probability that a randomly oriented needle of length $l$ originating in a bounded convex set $X\subset\mathbb{R}^2$ lies entirely within $X$.…
In this paper, we solve Buffon's needle problem for a needle consisting of two line segments connected in a pivot point.
A cluster of $n$ needles ($1\leq n<\infty$) is dropped at random onto a plane lattice of rectangles. Each needle is fixed at one end in the cluster centre and can rotate independently about this centre. The distribution of the relative…
The well-know needle experiment of Buffon can be regarded as an analog (i.e., continuous) device that stochastically "computes" the number 2/pi ~ 0.63661, which is the experiment's probability of success. Generalizing the experiment and…
What is the probability that a needle dropped at random on a set of points scattered on a line segment does not fall on any of them? We compute the exact scaling expression of this hole probability when the spacings between the points are…
In 1733, Georges-Louis Leclerc, Comte de Buffon in France, set the ground of geometric probability theory by defining an enlightening problem: What is the probability that a needle thrown randomly on a ground made of equispaced parallel…
We consider a model of randomness for self-similar Cantor sets of finite and positive $1$-Hausdorff measure. We find the sharp rate of decay of the probability that a Buffon needle lands $\delta$-close to a Cantor set of this particular…
Let $\Omega \subset \mathbb{R}^2$ be a convex set. We study the problem of distributing a one-dimensional set $S$ with total length $L$ so that for any line $\ell$ in $\mathbb{R}^2$ the number of intersections $\#(\ell \cap S)$ is…
Underwater robotics addresses the problem of object detection apparatus. Offers a probabilistic formulation of the problem, which uses the reduction of the detection task to a classical task of Buffon. This formulation arises naturally in…
We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…
I present a variant of the Buffon Needle method for determination of the value of the mathematical constant, pi. The original method is based on the random casting of a needle of length l onto a planked floor of plank width L. The described…
Consider a line segment placed on a two-dimensional grid of rectangular tiles. This paper addresses the relationship between the length of the segment and the number of tiles it visits (i.e. has intersection with). The square grid is also…
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
Let $C_n$ be the $n$-th generation in the construction of the middle-half Cantor set. The Cartesian square $K_n$ of $C_n$ consists of $4^n$ squares of side-length $4^{-n}$. The chance that a long needle thrown at random in the unit square…
We consider an affine Euclidean lattice and record the directions of all lattice vectors of length at most $T$. Str\"ombergsson and the second author proved in [Annals of Math.~173 (2010), 1949--2033] that the distribution of gaps between…
The finite colliding bullets problem is the following simple problem: consider a gun, whose barrel remains in a fixed direction; let $(V_i)_{1\le i\le n}$ be an i.i.d.\ family of random variables with uniform distribution on $[0,1]$; shoot…
Random 2-cell embeddings of a given graph $G$ are obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces, $\mathbb{E}[F_G]$, of such an embedding which is equivalent to studying its average…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two…