Central limit theorems for random polygons in an arbitrary convex set (Q533742): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Consider a Poisson point process in a convex set \(K\subset {\mathbb R}^2\) of intensity equal to the Lebesgue measure. Denote by \(\Pi_K\) the convex hull of the points of this process. \(\Pi_K\) is called a random Poisson polygon. Let \(N=N(\Pi_K)\) be the number of vertices of \(\Pi_K\) and \(A=A(\Pi_K)\) be the area of \(K\setminus \Pi_K\). In the paper the author studies the probability distributions of these random variables. The main result is a central limit theorem for both the area and the number of vertices (Theorem 1.1), which is uniform over the set of all convex \(K\). Note that the author requires no regularity on \(\partial K\). Previous results on random polygons analogous to Theorem 1.1 have been confined to two cases: 1) \(K\) is a polygon and 2) \(\partial K\) is of class \(C^2\) with nonvanishing curvature. In recent years there has been significant progress in the study of random polytopes, but again with additional conditions 1) and 2), see [\textit{I. Bárány} and \textit{M. Reitzner}, Ann. Probab. 38, No.~4, 1507--1531 (2010; Zbl 1204.60018); and Adv. Math. 225, No.~4, 1986--2001 (2010; Zbl 1204.52007)].
Property / review text: Consider a Poisson point process in a convex set \(K\subset {\mathbb R}^2\) of intensity equal to the Lebesgue measure. Denote by \(\Pi_K\) the convex hull of the points of this process. \(\Pi_K\) is called a random Poisson polygon. Let \(N=N(\Pi_K)\) be the number of vertices of \(\Pi_K\) and \(A=A(\Pi_K)\) be the area of \(K\setminus \Pi_K\). In the paper the author studies the probability distributions of these random variables. The main result is a central limit theorem for both the area and the number of vertices (Theorem 1.1), which is uniform over the set of all convex \(K\). Note that the author requires no regularity on \(\partial K\). Previous results on random polygons analogous to Theorem 1.1 have been confined to two cases: 1) \(K\) is a polygon and 2) \(\partial K\) is of class \(C^2\) with nonvanishing curvature. In recent years there has been significant progress in the study of random polytopes, but again with additional conditions 1) and 2), see [\textit{I. Bárány} and \textit{M. Reitzner}, Ann. Probab. 38, No.~4, 1507--1531 (2010; Zbl 1204.60018); and Adv. Math. 225, No.~4, 1986--2001 (2010; Zbl 1204.52007)]. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Viktor Ohanyan / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60D05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60F05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5885398 / rank
 
Normal rank
Property / zbMATH Keywords
 
random polygons
Property / zbMATH Keywords: random polygons / rank
 
Normal rank
Property / zbMATH Keywords
 
central limit theorem
Property / zbMATH Keywords: central limit theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
Poisson point process
Property / zbMATH Keywords: Poisson point process / rank
 
Normal rank

Revision as of 09:30, 1 July 2023

scientific article
Language Label Description Also known as
English
Central limit theorems for random polygons in an arbitrary convex set
scientific article

    Statements

    Central limit theorems for random polygons in an arbitrary convex set (English)
    0 references
    0 references
    0 references
    6 May 2011
    0 references
    Consider a Poisson point process in a convex set \(K\subset {\mathbb R}^2\) of intensity equal to the Lebesgue measure. Denote by \(\Pi_K\) the convex hull of the points of this process. \(\Pi_K\) is called a random Poisson polygon. Let \(N=N(\Pi_K)\) be the number of vertices of \(\Pi_K\) and \(A=A(\Pi_K)\) be the area of \(K\setminus \Pi_K\). In the paper the author studies the probability distributions of these random variables. The main result is a central limit theorem for both the area and the number of vertices (Theorem 1.1), which is uniform over the set of all convex \(K\). Note that the author requires no regularity on \(\partial K\). Previous results on random polygons analogous to Theorem 1.1 have been confined to two cases: 1) \(K\) is a polygon and 2) \(\partial K\) is of class \(C^2\) with nonvanishing curvature. In recent years there has been significant progress in the study of random polytopes, but again with additional conditions 1) and 2), see [\textit{I. Bárány} and \textit{M. Reitzner}, Ann. Probab. 38, No.~4, 1507--1531 (2010; Zbl 1204.60018); and Adv. Math. 225, No.~4, 1986--2001 (2010; Zbl 1204.52007)].
    0 references
    0 references
    0 references
    0 references
    0 references
    random polygons
    0 references
    central limit theorem
    0 references
    Poisson point process
    0 references