A Problem in Geometric Probability.
From MaRDI portal
Publication:3844707
DOI10.7146/MATH.SCAND.A-10655zbMATH Open0108.31603OpenAlexW1572529050MaRDI QIDQ3844707FDOQ3844707
Publication date: 1962
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/165817
Cited In (73)
- Storage capacity in symmetric binary perceptrons
- Compressive phase retrieval: Optimal sample complexity with deep generative priors
- Face numbers of high-dimensional Poisson zero cells
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
- Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data
- Limit theory for the first layers of the random convex hull peeling in the unit ball
- Facets of spherical random polytopes
- On Wendel's equality for intersections of balls
- Weighted Poisson--Delaunay Mosaics
- Universality of approximate message passing with semirandom matrices
- Random Polytopes on the Torus
- Grassmann angles and absorption probabilities of Gaussian convex hulls
- On nonnegative solutions of random systems of linear inequalities
- Positive hulls of random walks and bridges
- Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally
- Bounds on coverage probabilities of the empirical likelihood ratio confidence regions.
- Mixture Distributions Based Methods of Calibration for the Empirical Log-Likelihood Ratio
- Calibration of the empirical likelihood method for a vector mean
- Robust smoothed analysis of a condition number for linear programming
- Convex bodies, economic cap coverings, random polytopes
- Approximation of a ball by random polytopes
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Computational performance of a projection and rescaling algorithm
- High order recombination and an application to cubature on Wiener space
- Estimating the probability that a given vector is in the convex hull of a random sample
- Covering cubes by random half cubes, with applications to binary neural networks
- Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics
- Expected sizes of Poisson–Delaunay mosaics and their discrete Morse functions
- Extremal points of high-dimensional random walks and mixing times of a Brownian motion on the sphere
- Approximate Voronoi cells for lattices, revisited
- A new method of calibration for the empirical loglikelihood ratio
- Sylvester’s question and the random acceleration process
- Coverage processes on spheres and condition numbers for linear programming
- Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
- Random coverings
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Convex hulls of multidimensional random walks
- Gaussian polytopes: variances and limit theorems
- Approximation of smooth convex bodies by random polytopes
- Optimal stopping via pathwise dual empirical maximisation
- Average case recovery analysis of tomographic compressive sensing
- Random Gale diagrams and neighborly polytopes in high dimensions
- Monte Carlo cubature construction
- Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
- Probabilities of hitting a convex hull
- Random Point Sets on the Sphere—Hole Radii, Covering, and Separation
- Expectation of intrinsic volumes of random polytopes
- Title not available (Why is that?)
- The surface area deviation of the Euclidean ball and a polytope
- Conical tessellations associated with Weyl chambers
- Application of integral geometry to linear inequalities
- On the shape of the convex hull of random points
- A new approach to weak convergence of random cones and polytopes
- Programmed interactions in higher-order neural networks: Maximal capacity
- Phase transition for the volume of high‐dimensional random polytopes
- On the distribution of order types
- Stabbing simplices by points and flats
- BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
- Toward a \(50\%\)-majority equilibrium when voters are symmetrically distributed
- Absorption probabilities for Gaussian polytopes and regular spherical simplices
- Convex hulls of samples from spherically symmetric distributions
- Empirical likelihood ratio in penalty form and the convex hull problem
- F-distribution calibrated empirical likelihood ratio tests for multiple hypothesis testing
- Probability of unique integer solution to a system of linear equations
- Circumspheres of sets of n + 1 random points in the d-dimensional Euclidean unit ball (1 ≤ n ≤ d)
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Convex hulls of random walks, hyperplane arrangements, and Weyl chambers
- Intrinsic volumes of polyhedral cones: a combinatorial perspective
- Intrinsic volumes of symmetric cones and applications in convex programming
- Random polytopes in the d-dimensional cube
- On the Number of Vertices of Random Polyhedra with a Given Number of Facets
- Geometric probability on the sphere
This page was built for publication: A Problem in Geometric Probability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3844707)