Estranged facets and <i>k</i> -facets of Gaussian random point sets

Abstract Gaussian random polytopes have received a lot of attention, especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less-studied case where the dimension goes to infinity and the number of points is proportional to the dimension d . We study several natural quantities associated with Gaussian random polytopes in this setting. First, we show that the expected number of facets is equal to $C(\alpha)^{d+o(d)}$ , where $C(\alpha)$ is some constant which depends on the constant of proportionality $\alpha$ . We also extend this result to the expected number of k -facets. We then consider the more difficult problem of the asymptotics of the expected number of pairs of estranged facets of a Gaussian random polytope. When the number of points is 2 d , we determine the constant C such that the expected number of pairs of estranged facets is equal to $C^{d+o(d)}$ .

Authors

Institutions

Publication Details

Journal
Journal of Applied Probability
Published
2025-04-02
DOI
https://doi.org/10.1017/jpr.2024.114
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estranged facets and k -facets of Gaussian random point sets

Brett Leroux, Luis Rademacher
Journal of Applied Probability
Computational Geometry and Mesh Generation
article

Estranged facets and k -facets of Gaussian random point sets

Brett Leroux, Luis Rademacher
article en

Abstract

Abstract Gaussian random polytopes have received a lot of attention, especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less-studied case where the dimension goes to infinity and the number of points is proportional to the dimension d . We study several natural quantities associated with Gaussian random polytopes in this setting. First, we show that the expected number of facets is equal to $C(\alpha)^{d+o(d)}$ , where $C(\alpha)$ is some constant which depends on the constant of proportionality $\alpha$ . We also extend this result to the expected number of k -facets. We then consider the more difficult problem of the asymptotics of the expected number of pairs of estranged facets of a Gaussian random polytope. When the number of points is 2 d , we determine the constant C such that the expected number of pairs of estranged facets is equal to $C^{d+o(d)}$ .

Journal of Applied ProbabilityVol. 62(3)
University of California System (US)
Openalex Percentile: Top 89%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Estranged facets and <i>k</i> -facets of Gaussian random point sets — Brett Leroux, Luis Rademacher · Journal of Applied Probability (2025) | TGRS Research Map | TGRS