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