Related papers: Angle between two random segments
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a…
Subject of this letter is the dynamics of a chain obtained performing the continuous limit of a system of links and beads. In particular, the probability distribution of the relative position between two points of the chain averaged over a…
Consider a $d$-dimensional simplex whose vertices are random points chosen independently according to the standard Gaussian distribution on $\mathbb R^d$. We prove that the expected angle sum of this random simplex equals the angle sum of…
We examine the extent to which random samplings from the values of a random set, determine the distribution of the random set itself. We also comment on how, given the statistics of the sampling, to detect the distribution. Several methods…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
We measure the projected angle on the plane of the sky between adjacent symmetry axes of tens of multipolar planetary nebulae and find that the distribution of these misalignment angles implies a random three-dimensional angle distribution…
Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…
In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
We use the geometric concept of principal angles between subspaces to compute the noncommutative distribution of an expression involving two free projections. For example, this allows to simplify a formula by…
Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
A wide range of physical problems can be described by randomly-oriented linear trajectories, including any system of objects, organisms, particles, or rays that follow a linear path. Dependent upon the particular random variables that…
It is argued that spectral features of quantal systems with random interactions can be given a geometric interpretation. This conjecture is investigated in the context of two simple models: a system of randomly interacting d bosons and one…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a…
In this paper we obtain the chord length distribution function for any regular polygon. From this function we conclude the density function and the distribution function of the distance between two uniformly and independently distributed…