Central limit theorems for uniform model random polygons (Q715751): Difference between revisions

From the introduction: ``Given a convex set \(K\subset \mathbb R^2\) of unit area, we may define two random polygon models. For the Poisson model, we consider a Poisson process of intensity \(\lambda\) inside \(K\), and define \(\Pi_{K,\lambda}\) to be the convex hull of the points of this process. For the uniform model, we take \(n\) independent random points distributed uniformly in \(K\) and let \(P_{K, n}\) be their convex hull. For a polygon \(\mathcal P\) inside \(K\), let \(N({\mathcal P})\) denote the number of vertices of \(\mathcal P\), and \(A({\mathcal P})\) denote the area of \(K\setminus {\mathcal P}\). When one wants to prove central limit theorems for \(N({\mathcal P})\) and \(A({\mathcal P})\) in either of the two models of random polygons, it is often the case that the Poisson model is easier than the uniform model.'' The aim of the paper is to extend the results for \(\Pi_{K,\lambda}\) of the author's paper [Ann. Probab. 39, No. 3, 881--903 (2011; Zbl 1221.52011)] extend to the \(P_{K, n}\) model. To prove this implication, the author shows that in the two models, the variables \(N({\mathcal P})\) and \(A({\mathcal P})\) have asymptotically the same expectation and variance.