اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDoubly random polytopes
130
0
0.0
(
0
)
تأليف
Andrew Newman
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in $mathbb{R}^d$, and the second step is to sample each vertex of $P$ independently with probability $p$ and let $Q$ be the convex hull of the sampled vertices. We establish results on how well $Q$ approximates the unit sphere in terms of $m$ and $p$ as well as asymptotics on the combinatorial complexity of $Q$ for certain regimes of $p$.
قيم البحث
اقرأ أيضاً
Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was shown by Dyer-
Furedi-McDiarmid that exponentially many samples suffice when the convex body is the hypercube, and by Pivovarov that the Euclidean ball demands roughly $d^{d/2}$ samples. We show that when the convex body is the simplex, exponentially many samples suffice; this then implies the same result for any convex simplicial polytope with at most exponentially many faces.
We propose a new geometric method for measuring the quality of representations obtained from deep learning. Our approach, called Random Polytope Descriptor, provides an efficient description of data points based on the construction of random convex p
olytopes. We demonstrate the use of our technique by qualitatively comparing the behavior of classic and regularized autoencoders. This reveals that applying regularization to autoencoder networks may decrease the out-of-distribution detection performance in latent space. While our technique is similar in spirit to $k$-means clustering, we achieve significantly better false positive/negative balance in clustering tasks on autoencoded datasets.
In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture. It is well-known that the three conjectures
hold in dimensions d leq 3. We show that in dimension 4 only conjectures A and B are valid, while conjecture C fails. Furthermore, we show that both conjectures B and C fail in all dimensions d geq 5.
We introduce the fatness parameter of a 4-dimensional polytope P, defined as phi(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We describe and a
nalyze a hyperbolic geometry construction that produces 4-polytopes with fatness phi(P)>5.048, as well as the first infinite family of 2-simple, 2-simplicial 4-polytopes. Moreover, using a construction via finite covering spaces of surfaces, we show that fatness is not bounded for the more general class of strongly regular CW decompositions of the 3-sphere.
A question related to some conjectures of Lutwak about the affine quermassintegrals of a convex body $K$ in ${mathbb R}^n$ asks whether for every convex body $K$ in ${mathbb R}^n$ and all $1leqslant kleqslant n$ $$Phi_{[k]}(K):={rm vol}_n(K)^{-frac{1
}{n}}left (int_{G_{n,k}}{rm vol}_k(P_F(K))^{-n},d u_{n,k}(F)right )^{-frac{1}{kn}}leqslant csqrt{n/k},$$ where $c>0$ is an absolute constant. We provide an affirmative answer for some broad classes of random polytopes. We also discuss upper bounds for $Phi_{[k]}(K)$ when $K=B_1^n$, the unit ball of $ell_1^n$, and explain how this special instance has implications for the case of a general unconditional convex body $K$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
