Geometrical Probability and Random Points on a Hypersphere

نویسنده

  • BRADLEY EFRON
چکیده

0. Summary. This paper is concerned with the properties of convex cones and their dual cones generated by points randomly distributed on the surface of a d-sphere. For radially symmetric distributions on the points, the expected nGmber of k-faces and natural measure of the set of k-faces will be found. The expected number of vertices, or extreme points, of convex hulls of random points in E~ and E3 has been investigated by RBnyi and Sulanke [4] and Efron [2]. In general these results depend critically on the distribution of the points. However, for points on a sphere, the situation is much simpler. Except for a requirement of radial symmetry of the distribution on the points, the properties developed in this paper will be distribution-free. (This lack of dependence on the underlying distribution suggests certain simple nonparametric tests for radial symmetry-we shall not pursue this matter here, however.) Our approach is combinatorial and geometric, involving the systematic description of the partitioning of E d by N hyperplanes through the origin. After a series of theorems counting the number of faces of cones and their duals, we are led to Theorem 5 and its probabilistic counterpart Theorem 2', the primary result of this paper, in which the expected solid angle is found of the convex cone spanned by N random vectors in Ed.

منابع مشابه

Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random

The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...

متن کامل

Hypersphere Sampling for Accelerating High-Dimension and Low-Failure Probability Circuit-Yield Analysis

This paper proposes a novel and an efficient method termed hypersphere sampling to estimate the circuit yield of low-failure probability with a large number of variable sources. Importance sampling using a mean-shift Gaussian mixture distribution as an alternative distribution is used for yield estimation. Further, the proposed method is used to determine the shift locations of the Gaussian dis...

متن کامل

A Short Note on The Volume of Hypersphere

In this note, a new method for deriving the volume of hypersphere is proposed by using probability theory. The explicit expression of the multiple times convolution of the probability density functions we should use is very complicated. But in here, we don’t need its whole explicit expression. We just need the only a part of information and this fact make it possible to derive the general expre...

متن کامل

Trending and pattern recognition using the sphere-hardening phenomenon of signal multidimensional projection

In trending and pattern recognition, the signal comprises a series of samples having a characteristic sequence, the so-called signature, repeatable from one measurement to another. Most of the non-repeatable part of the measurement comes from the measured intrinsic random contribution of the physical phenomenon, ambient noise, measurement system noise, and the temporal evolution of the physical...

متن کامل

Generating Similar Graphs From Spherical Features

We present new insights on model degeneracy and a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute graph features in Euclidean space, our method obtains features on a surface of a hypersphere. We utilize a von Mises-Fisher distribution, an exponential family distribution on the surface of a hypersphere, to define a model over possible f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007