Related papers: Triangle Inscribed-Triangle Picking
The likelihood-free sequential Approximate Bayesian Computation (ABC) algorithms, are increasingly popular inference tools for complex biological models. Such algorithms proceed by constructing a succession of probability distributions over…
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…
Two points are randomly selected inside a three-dimensional euclidian cube. The value l of their separation lies somewhere between zero and the length of a diagonal of the cube. The probability density P(l) of the separation is obtained…
We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…
We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…
Stationary Poisson processes of lines in the plane are studied whose directional distributions are concentrated on $k \ge 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random…
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open…
We present the relativistic analogue of Anderson localization in one dimension. We use Dirac equation to calculate the transmission probability for a spin-$\frac{1}{2}$ particle incident upon a rectangular barrier. Using the transfer matrix…
For a certain class of functions, the distribution of the function values can be calculated in the trellis or a sub-trellis. The forward/backward recursion known from the BCJR algorithm is generalized to compute the moments of these…
We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…
A simple way to sample a uniform triangulation of the sphere with a fixed number $n$ of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in…
Given a triangle, what is the equation of the line which bisects its area and has a given slope? The set of all lines bisecting the area of a triangle has been elegantly determined as a certain 'deltoid' envelope and this gives an indirect…
In this paper we partially resolve Hall's conjecture about the distribution of random triangles. We consider the probability that three points chosen uniformly at random, in a bounded convex region of the plane, form an acute triangle.…
In the system of approval voting, individuals vote for all candidates they find acceptable. Many approval voting situations can be modeled geometrically, and thus geometric concepts such as the piercing number have a natural interpretation.…
If P is a point inside triangle ABC, then the cevians through P divide triangle ABC into six smaller triangles. We give theorems about the relationship between the radii of the circles inscribed in these triangles.
If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…
We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…
We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the…
We consider a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions (TSSCPPs). These triangles correspond to a ballot process in which…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold…