Counting the faces of randomly-projected hypercubes and orthants, with applications
From MaRDI portal
Publication:2380787
DOI10.1007/s00454-009-9221-zzbMath1191.52004arXiv0807.3590OpenAlexW2101837693MaRDI QIDQ2380787
Publication date: 12 April 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3590
(n)-dimensional polytopes (52B11) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Random convex sets and integral geometry (aspects of convex geometry) (52A22)
Related Items (48)
Positive hulls of random walks and bridges ⋮ Convex cones spanned by regular polytopes ⋮ Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Face numbers of high-dimensional Poisson zero cells ⋮ Random conical tessellations ⋮ Counting the faces of randomly-projected hypercubes and orthants, with applications ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ The restricted isometry property of block diagonal matrices for group-sparse signal recovery ⋮ Compressed sensing for finite-valued signals ⋮ PROMP: a sparse recovery approach to lattice-valued signals ⋮ Angle sums of Schläfli orthoschemes ⋮ The convex geometry of linear inverse problems ⋮ Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization ⋮ Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays ⋮ Performance comparisons of greedy algorithms in compressed sensing ⋮ A central limit theorem for projections of the cube ⋮ Projections and angle sums of belt polytopes and permutohedra ⋮ Random cones in high dimensions II: Weyl cones ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ A theory of capacity and sparse neural encoding ⋮ Unnamed Item ⋮ Universality of approximate message passing with semirandom matrices ⋮ \(r\)-Lah distribution: properties, limit theorems and an application to compressed sensing ⋮ Testing the nullspace property using semidefinite programming ⋮ Model selection with low complexity priors ⋮ The solution path of the generalized lasso ⋮ Average case recovery analysis of tomographic compressive sensing ⋮ Exact reconstruction using Beurling minimal extrapolation ⋮ Probabilities of hitting a convex hull ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement ⋮ Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices ⋮ Probability of unique integer solution to a system of linear equations ⋮ Ear decomposition and balanced neighborly simplicial manifolds ⋮ A new look at random projections of the cube and general product measures ⋮ Tomographic reconstruction of 3D objects using marked point process framework ⋮ Random Gale diagrams and neighborly polytopes in high dimensions ⋮ From Steiner formulas for cones to concentration of intrinsic volumes ⋮ Sharp oracle inequalities for low-complexity priors ⋮ Linear Positive Systems May Have a Reachable Subset from the Origin That is Either Polyhedral or Nonpolyhedral ⋮ Unnamed Item ⋮ Lattices from tight frames and vertex transitive graphs ⋮ On a game of chance in Marc Elsberg's thriller ``GREED ⋮ Absorption probabilities for Gaussian polytopes and regular spherical simplices ⋮ Monotonicity of expected 𝑓-vectors for projections of regular polytopes ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates ⋮ Threshold phenomena for random cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling
- On nonnegative solutions of random systems of linear inequalities
- Random projections of regular simplices
- Gaussian samples, regular simplices, and exchangeability
- Random projections of regular polytopes
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Stochastic and Integral Geometry
- On Sparse Representations in Arbitrary Redundant Bases
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- A Problem in Geometric Probability.
- Lectures on Polytopes
- Convex Polytopes
- What is known about unit cubes
- Oriented Matroids
- Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Partitions ofN-Space by Hyperplanes
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- A Class of Convex Bodies
This page was built for publication: Counting the faces of randomly-projected hypercubes and orthants, with applications
