Related papers: How doth the random triangle
We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to…
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
We present a conclusive answer to Bertrand's paradox, a long standing open issue in the basic physical interpretation of probability. The paradox deals with the existence of mutually inconsistent results when looking for the probability…
In this paper we report on an experimental test of Bertrand's question on the probability to find a random chord drawn inside a unit-radius circle with length greater than $\sqrt{3}$. In an experiment performed by tossing straws onto a…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Chance constraints describe a set of given random inequalities depending on the decision vector satisfied with a large enough probability. They are widely used in decision making under uncertain data in many engineering problems. This paper…
Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has…
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
In this article, the authors give the correct answer to the following problem, which is presented in the well-known problem book "CHALLENGING MATHEMATICAL PROBLEMS WITH ELEMENTARY SOLUTIONS"? by A. M. Yaglom and L. M. Yaglom. There are six…
Triangular distributions are a well-known class of distributions that are often used as an elementary example of a probability model. Maximum likelihood estimation of the mode parameter of the triangular distribution over the unit interval…
The Honeycomb Conjecture states that among tilings with unit area cells in the Euclidean plane, the average perimeter of a cell is minimal for a regular hexagonal tiling. This conjecture was proved by L. Fejes T\'oth for convex tilings, and…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
Suppose that $k$ is a function of $n$ and $n\to\infty$. We show that with probability $1-O(1/n)$, a uniformly random $k\times n$ Latin rectangle contains no proper Latin subsquare of order $4$ or more, proving a conjecture of Divoux, Kelly,…
We prove that the expected area of the amoeba of a complex plane curve of degree $d$ is less than $\displaystyle{3\ln(d)^2/2+9\ln(d)+9}$ and once rescaled by $\ln(d)^2$, is asymptotically bounded from below by $3/4$. In order to get this…
Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega=(\omega_n)_{n\geq 1}$ uniformly distributed…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…