Related papers: The Probability that a Random Triangle in a Cube i…
Let Delta be a random spherical triangle (meaning that vertices are independent and uniform on the unit sphere). A closed-form expression for the area density of Delta has been known since 1867; a complicated integral expression for the…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…
The problem of the Rivlin cube is to determine the stability of all homogeneous equilibria of an isotropic incompressible hyperelastic body under equitriaxial dead loads. Here, we consider the stochastic version of this problem where the…
We show that for a convex solid set of positive random variables to be tight, or equivalently bounded in probability, it is necessary and sufficient that it is radially bounded, i.e. that every ray passing through one of its elements…
We study the folding of the regular two-dimensional triangular lattice embedded in the regular three-dimensional Face Centered Cubic lattice, in the presence of quenched random spontaneous curvature. We consider two types of quenched…
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random…
We investigate the probability that a random quadratic form in ${\mathbb{Z}}[x_1,...,x_n]$ has a totally isotropic subspace of a given dimension. We show that this global probability is a product of local probabilities. Our main result…
A rhombus tiling of a hexagon is said to be centered if it contains the central lozenge. We compute the number of vertically symmetric rhombus tilings of a hexagon with side lengths $a, b, a, a, b, a$ which are centered. When $a$ is odd and…
We explicitly describe the possible pairs of triangle and square densities for r-regular finite simple graphs. We also prove that every r-regular unimodular random graph can be approximated by r-regular finite graphs with respect to these…
This paper questions the generally accepted assumption that one can make a random choice that is independent of the rest of the universe. We give a general description of any setup that could be conceived to generate random numbers. Based…
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…
A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule…
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.
We show that a perturbation of any fixed square matrix D by a random unitary matrix is well invertible with high probability. A similar result holds for perturbations by random orthogonal matrices; the only notable exception is when D is…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
Probability of coincidental clustering among the orbits of comets, asteroids and meteoroids depends on many factors like: the size of the orbital sample searched for clusters or the size of the identified group, it is different for groups…
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose…
We study arithmetic constraints arising from the three faces meeting along the space diagonal of a rectangular cuboid. Using a propagation mechanism along this diagonal, based on the appearance of a minimal odd prime in certain triangular…