Related papers: Estimates from below of the Buffon noodle probabil…
Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…
We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius $r$. We show numerically that the characteristic length of random knotting is roughly…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
A cyclic urn is an urn model for balls of types $0,\ldots,m-1$ where in each draw the ball drawn, say of type $j$, is returned to the urn together with a new ball of type $j+1 \mod m$. The case $m=2$ is the well-known Friedman urn. The…
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…
The fractal properties of models of randomly placed $n$-dimensional spheres ($n$=1,2,3) are studied using standard techniques for calculating fractal dimensions in empirical data (the box counting and Minkowski-sausage techniques). Using…
We are discussing the present situation with neutron lifetime measurements. There is a serious discrepancy between the previous experiments and the recent precise experiment [1]. The possible reason of the discrepancy can be connected with…
Bucket Sort is known to run in expected linear time when the input keys are distributed independently and uniformly at random in the interval $[0,1)$. The analysis holds even when a quadratic time algorithm is used to sort the keys in each…
A cyclic urn is an urn model for balls of types $0,\ldots,m-1$. The urn starts at time zero with an initial configuration. Then, in each time step, first a ball is drawn from the urn uniformly and independently from the past. If its type is…
The worst-case expected length f(n) of the path taken by the simplex algorithm with the Random Edge pivot rule on a 3-dimensional linear program with n constraints is shown to be bounded by 1.3445 n <= f(n) <= 1.4943 n for large enough n.
This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we…
We present arguments in favour of the inequalities $var(X_n^2|X \in B_v(\rho)) \le 2\lambda_n E[X_n^2|X \in B_v(\rho)]$, where $X \sim N_v(0,\Lambda)$ is a normal vector in $v\ge 1$ dimensions, with zero mean and covariance matrix $\Lambda…
The celebrated Littlewood-Offord problem asks for an upper bound on the probability that the random variable $\epsilon_1 v_1 + \cdots + \epsilon_n v_n$ lies in the Euclidean unit ball, where $\epsilon_1, \ldots, \epsilon_n \in \{-1, 1\}$…
We study the dynamics of a quantum rotator kicked according to the almost-periodic Fibonacci sequence. A special numerical technique allows us to carry on this investigation for as many as $10^{12}$ kicks. It is shown that above a critical…
Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…
Upper bounds are obtained for the Newtonian capacity of compact sets in $\R^d,\,d\ge 3$ in terms of the perimeter of the $r$-parallel neighbourhood of $K$. For compact, convex sets in $\R^d,\,d\ge 3$ with a $C^2$ boundary the Newtonian…
We consider the problem of estimating the covariance structure of a random vector $Y\in \mathbb R^d$ from a sample $Y_1,\ldots,Y_n$. We are interested in the situation when $d$ is large compared to $n$ but the covariance matrix $\Sigma$ of…
In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…
We continue our investigation of the fractal uncertainty principle (FUP) for random fractal sets. In the prequel (arXiv:2107.08276), we considered the Cantor sets in the discrete setting with alphabets randomly chosen from a base of digits…
A certain sampling process, concerning an urn with balls of two colors, proposed in 1965 by B.E. Oakley and R.L. Perry, and discussed by Peter Winkler and Martin Gardner, that has an extremely simple answer for the probability, namely the…