English
Related papers

Related papers: Random Gaussian Tetrahedra

200 papers

Let us consider the set $\Omega (\triangle ABC)$ of all tetrahedra $ABCD$ with a given non-degenerate base $ABC$ in $\mathbb{E}^3$ and $D$ lying outside the plane $ABC$. Let us denote by $\Sigma(\triangle ABC)$ the set $\left\{\Bigl(\cos…

Metric Geometry · Mathematics 2026-03-09 E. V. Nikitenko , Yu. G. Nikonorov

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…

Probability · Mathematics 2014-02-17 Jean-François Marckert

For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\cal S}_3 \subset \mathbb R^4$ of all vectors…

Combinatorics · Mathematics 2013-12-10 Hao Huang , Nati Linial , Humberto Naves , Yuval Peled , Benny Sudakov

Consider two half-spaces $H_1^+$ and $H_2^+$ in $\mathbb{R}^{d+1}$ whose bounding hyperplanes $H_1$ and $H_2$ are orthogonal and pass through the origin. The intersection $\mathbb{S}_{2,+}^d:=\mathbb{S}^d\cap H_1^+\cap H_2^+$ is a spherical…

We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…

Probability · Mathematics 2019-06-05 Vincent Guigues

The curse of dimensionality is a common phenomenon which affects analysis of datasets characterized by large numbers of variables associated with each point. Problematic scenarios of this type frequently arise in classification algorithms…

Probability · Mathematics 2015-08-11 Benjamin Thirey , Randal Hickman

The prediction of the final state probabilities of a general cuboid randomly thrown onto a surface is a problem that naturally arises in the minds of men and women familiar with regular cubic dice and the basic concepts of probability.…

Classical Physics · Physics 2014-07-24 G. A. T. Pender , M. Uhrin

We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…

Mathematical Physics · Physics 2020-08-26 Dario Benedetto , Emanuele Caglioti

Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…

Probability · Mathematics 2024-09-13 Hugo Panzo

Settling a first case of a conjecture of M. Kahle on the homology of the clique complex of the random graph $G=G_{n,p}$, we show, roughly speaking, that (with high probability) the triangles of $G$ span its cycle space whenever each of its…

Probability · Mathematics 2012-07-31 Bobby DeMarco , Arran Hamm , Jeff Kahn

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

Probability · Mathematics 2011-04-20 Jonathan Jordan

We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…

Probability · Mathematics 2018-12-12 Pu Gao , Remco van der Hofstad , Angus Southwell , Clara Stegehuis

In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…

General Mathematics · Mathematics 2021-01-26 Yanyan Zhuang , Jianping Pan

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

Metric Geometry · Mathematics 2007-08-21 Ronen Eldan , Bo'az Klartag

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Number Theory · Mathematics 2014-02-26 Andreas Strömbergsson

We compute the path integral of three-dimensional gravity with negative cosmological constant on spaces which are topologically a torus times an interval. These are Euclidean wormholes, which smoothly interpolate between two asymptotically…

High Energy Physics - Theory · Physics 2022-07-28 Jordan Cotler , Kristan Jensen

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

Combinatorics · Mathematics 2018-06-14 Sergey Sidorov

The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…

Statistical Mechanics · Physics 2015-05-13 Stefan Mashkevich , Stéphane Ouvry

What is the probability that a random UHF algebra is of infinite type? What is the probability that a random simple AI algebra has at most $k$ extremal traces? What is the expected value of the radius of comparison of a random…

Operator Algebras · Mathematics 2023-08-16 Bhishan Jacelon

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein
‹ Prev 1 3 4 5 6 7 10 Next ›