Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Variance expansion and Berry-Esseen bound for the number of vertices of a random polygon in a polygon

View through CrossRef
Fix a container polygon P in the plane and consider the convex hull P n of n ≥ 3 independent and uniformly distributed in P random points. In the focus of this paper is the vertex number of the random polygon P n . The precise variance expansion for the vertex number is determined up to the constant-order term, a result which can be considered as a second-order analogue of the classical expansion for the expectation of Rényi and Sulanke (1963). Moreover, a sharp Berry–Esseen bound is derived for the vertex number of the random polygon P n , which is of the same order as one over the square-root of the variance. The latter is optimal and improves the earlier result of Bárány and Reitzner (2006) by removing the factor ( log log n ) 60 in the planar case. The main idea behind the proof of both results is a decomposition of the boundary of the random polygon P n into random convex chains and a careful merging of the variance expansions and Berry–Esseen bounds for the vertex numbers of the individual chains. In the course of the proof, we derive similar results for the Poissonized model.
Title: Variance expansion and Berry-Esseen bound for the number of vertices of a random polygon in a polygon
Description:
Fix a container polygon P in the plane and consider the convex hull P n of n ≥ 3 independent and uniformly distributed in P random points.
In the focus of this paper is the vertex number of the random polygon P n .
The precise variance expansion for the vertex number is determined up to the constant-order term, a result which can be considered as a second-order analogue of the classical expansion for the expectation of Rényi and Sulanke (1963).
Moreover, a sharp Berry–Esseen bound is derived for the vertex number of the random polygon P n , which is of the same order as one over the square-root of the variance.
The latter is optimal and improves the earlier result of Bárány and Reitzner (2006) by removing the factor ( log log n ) 60 in the planar case.
The main idea behind the proof of both results is a decomposition of the boundary of the random polygon P n into random convex chains and a careful merging of the variance expansions and Berry–Esseen bounds for the vertex numbers of the individual chains.
In the course of the proof, we derive similar results for the Poissonized model.

Related Results

Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Characterization of berry and wine aroma development in interspecific hybrids important to Missouri using a metabolomics based approach
Characterization of berry and wine aroma development in interspecific hybrids important to Missouri using a metabolomics based approach
With increases in climate extremes resulting in more abiotic and biotic stress on crops such as grapes, it is essential to develop new cultivars that are more robust than the tradi...
Query expansion by relying on the structure of knowledge bases
Query expansion by relying on the structure of knowledge bases
Query expansion techniques aim at improving the results achieved by a user's query by means of introducing new expansion terms, called expansion features. Expansion features introd...
Advances in berry research: The sixth Biennial Berry Health Benefits Symposium
Advances in berry research: The sixth Biennial Berry Health Benefits Symposium
Studies to advance the potential health benefits of berries continue to increase as was evident at the sixth biennial meeting of the Berry Health Benefits Symposium (BHBS). The two...
AI-Driven Solutions for Optimising Drawer Expansion and Storage Management of Entomology Collections
AI-Driven Solutions for Optimising Drawer Expansion and Storage Management of Entomology Collections
The digitisation of natural history collections at scale raises a range of logistical and curatorial challenges. One concern is the physical expansion of storage infrastructure. As...
4‐regular graphs without cut‐vertices having the same path layer matrix
4‐regular graphs without cut‐vertices having the same path layer matrix
AbstractThe path layer matrix of a graph G contains quantitative information about all possible paths in G. The entry (i,j) of this matrix is the number of paths in G having initia...
The Geodesic Edge Center of a Simple Polygon
The Geodesic Edge Center of a Simple Polygon
Abstract The geodesic edge center of a simple polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, wher...

Back to Top