pith. sign in

arxiv: 2111.01725 · v1 · submitted 2021-11-02 · 🧮 math.MG · math.PR

Variance bounds for disc-polygons

Ferenc Fodor , Bal\'azs Gr\"unfelder , Viktor V\'igh This is my paper

Pith reviewed 2026-05-24 12:15 UTC · model grok-4.3

classification 🧮 math.MG math.PR
keywords variance boundsdisc-polygonsasymptotic lower boundsconvex discsrandom polygonsmissed areasmooth boundariesstochastic geometry
0
0 comments X

The pith

Lower bounds on variances of vertices and missed area in random disc-polygons match the order of prior upper bounds for C_+^2 smooth convex discs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that for convex discs whose boundaries are twice continuously differentiable with positive curvature, the variance of the number of vertices in a random disc-polygon admits an asymptotic lower bound of the same order as the upper bound established earlier. It establishes an analogous result for the variance of the missed area between the disc-polygon and the original convex disc. This matching of orders shows that the fluctuations in these random approximations are pinned to a specific scaling rate rather than merely bounded from above. A reader interested in stochastic geometry would care because the result completes the picture of how variability behaves in these constructions under the stated smoothness.

Core claim

We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is C_+^2 smooth. The established lower bounds are of the same order as the upper bounds proved previously by Fodor and Vígh (2018).

What carries the argument

Asymptotic lower-bound analysis applied to the random disc-polygon model inside a C_+^2 convex disc, which produces variance estimates matching the known upper bounds.

If this is right

  • The variance of the number of vertices is of exactly the same order as the previously known upper bound.
  • The variance of the missed area is likewise pinned to matching lower and upper orders.
  • Fluctuations in random disc-polygons inside smooth convex bodies are now known to scale at a definite rate rather than merely being O of that rate.
  • The C_+^2 condition is sufficient to achieve this tight asymptotic control on both sides.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The matching bounds suggest that explicit constants in the variance asymptotics might be derivable by refining the same techniques.
  • Similar lower-bound methods could apply to other functionals of random disc-polygons such as perimeter or diameter.
  • The result indicates that smoothness assumptions are necessary for the variance to achieve this particular scaling; rougher boundaries might produce different orders.
  • Applications to approximation quality in computational geometry could use these variance rates to bound the expected error in random sampling schemes.

Load-bearing premise

The boundary of the convex disc must be twice continuously differentiable with positive curvature everywhere.

What would settle it

Computation of the variance of vertex count for a sequence of random disc-polygons in a fixed C_+^2 convex disc showing growth slower than the known upper-bound order would falsify the claim.

Figures

Figures reproduced from arXiv: 2111.01725 by Bal\'azs Gr\"unfelder, Ferenc Fodor, Viktor V\'igh.

Figure 1
Figure 1. Figure 1: Splitting ∆m Lemma 1. Let Z be a uniform random point in ∆0(x, t). Then Var(Aˆ(Z)) t 3 . Proof. Let w denote the midpoint of the side opposite to x in the triangle ∆0(x, t). Let ∆ (1) 0 (x, t) = x + 1 3 (∆0(x, t) − x) and ∆ (2) 0 (x, t) = w + 1 3 (∆0(x, t) − w), [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Angle of circular arcs and chords i.e. in the triangle ∆0(x, t) we take two smaller triangles which are the shrunk images of ∆0(x, t) by a factor of 1/3 from x and w. The area of ∆(1) 0 and ∆(2) 0 is one-ninth of that of ∆0, respectively. For every Z1 ∈ ∆ (1) 0 and Z2 ∈ ∆ (2) 0 , it holds that ∆( e Z1) ⊃ ∆( e Z2), therefore Aˆ(Z1) > Aˆ(Z2). Let ∆m = ∆( e Z1) \ ∆( e Z2). We need A(∆m). Cut ∆m by a segment t… view at source ↗
Figure 3
Figure 3. Figure 3: K bounded between circles need that ε < c5 2c4 . Note that constant on the right-hand side of the inequality depends only on K. Since t → 0, ε can be chosen smaller than that. The only restriction on ε is that K has to be locally between the two circles, that is, the intersection point c6t deep is in this range. Therefore, we can choose ε arbitrary small. Thus for every K, the circular arc determined by th… view at source ↗
read the original abstract

We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds proved previously by Fodor and V\'{\i}gh (2018).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper proves asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is C_+^2 smooth. The established lower bounds are of the same order as the upper bounds proved previously by Fodor and Vígh (2018).

Significance. If the proofs hold, the result completes the asymptotic variance picture for this model of random inscribed polygons by supplying matching lower bounds under the standard C_+^2 hypothesis, thereby confirming the order of fluctuations for both vertex count and approximation error.

major comments (1)
  1. [Abstract] The central claim asserts the existence of a full proof establishing the lower bounds, but the provided manuscript text consists only of the abstract; no technical lemmas, error-term estimates, or derivation steps are visible, so it is impossible to verify whether the matching-order lower bounds are actually established.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for reviewing our manuscript. The single major comment appears to stem from an incomplete view of the submission; we address it directly below and confirm that the full paper contains the complete technical development.

read point-by-point responses

  1. Referee: [Abstract] The central claim asserts the existence of a full proof establishing the lower bounds, but the provided manuscript text consists only of the abstract; no technical lemmas, error-term estimates, or derivation steps are visible, so it is impossible to verify whether the matching-order lower bounds are actually established.

    Authors: The submitted manuscript is the complete paper (arXiv:2111.01725), whose abstract is followed by the full proof. Under the C_+^2 hypothesis the argument proceeds by constructing suitable test functions on the support function, applying the variance formula for Poisson processes, and deriving matching lower bounds via careful asymptotic analysis of the resulting integrals; all error-term estimates and technical lemmas are contained in the body of the text. The lower bounds are shown to be of the same order as the upper bounds of Fodor and Vígh (2018). If the referee received only the abstract page, we are happy to resupply the full PDF. revision: no

Circularity Check

0 steps flagged

Minor self-citation for upper-bound comparison; lower-bound proof independent

full rationale

The paper's central result is a proof of asymptotic lower bounds on variances for vertex count and missed area in random disc-polygons, under the C_+^2 boundary condition. This proof is presented as new content in the current manuscript. The only self-citation is to the 2018 Fodor-Vígh paper for the matching upper bounds (used solely to state that the new lower bounds are of the same order). No equation or derivation step in the abstract reduces by construction to a fitted input, self-defined quantity, or unverified self-citation chain. The smoothness assumption is a standard technical hypothesis for the scaling regime and is not derived from prior self-work. This matches the expected low-circularity case for a paper whose main contribution is an independent proof.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on the domain assumption of C_+^2 smoothness of the boundary. No free parameters or invented entities are mentioned in the abstract.

axioms (1)
  • domain assumption The boundary of the convex disc is C_+^2 smooth (twice continuously differentiable with positive curvature).
    Explicitly required in the abstract for the asymptotic lower bounds to hold.

pith-pipeline@v0.9.0 · 5568 in / 1274 out tokens · 19202 ms · 2026-05-24T12:15:15.367343+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Baddeley, I

    A. Baddeley, I. B´ ar´ any, and R. Schneider,Random Polytopes, Convex Bodies, and Approxi- mation, Lecture Notes in Mathematics 1892 (2006), 77-118

    work page 2006

  2. [2]

    B´ ar´ any,Random points and lattice points in convex bodies , Bulletin of The American Mathematical Society 45 (2008), 339-365

    I. B´ ar´ any,Random points and lattice points in convex bodies , Bulletin of The American Mathematical Society 45 (2008), 339-365. 12 F. FODOR, B. GR ¨UNFELDER, AND V. V´IGH

    work page 2008

  3. [3]

    B´ ar´ any and W

    I. B´ ar´ any and W. Steiger,On the variance of random polygons , Comput. Geom. 46 (2013), no. 2, 173–180

    work page 2013

  4. [4]

    B´ ar´ any and M

    I. B´ ar´ any and M. Reitzner,On the variance of random polytopes , Adv. Math. 225 (2010), no. 4, 1986–2001

    work page 2010

  5. [5]

    Besau, D

    F. Besau, D. Rosen, and C. Th¨ ale, Random inscribed polytopes in projective geometries , arXiv:2005.10502 (2021)

    work page arXiv 2005

  6. [6]

    Bezdek, Z

    K. Bezdek, Z. L´ angi, M. Nasz´ odi, and P. Papez,Ball-polyhedra, Discrete Comput. Geom. 38 (2007), no. 2, 201–230

    work page 2007

  7. [7]

    K. J. B¨ or¨ oczky, F. Fodor, M. Reitzner, and V. V´ ıgh,Mean width of random polytopes in a reasonably smooth convex body, J. Multivariate Anal. 100 (2009), no. 10, 2287–2295

    work page 2009

  8. [8]

    Fodor, P

    F. Fodor, P. Kevei, and V. V´ ıgh,On random disc polygons in smooth convex discs , Adv. in Appl. Probab. 46 (2014), no. 4, 899–918

    work page 2014

  9. [9]

    Fodor, P

    F. Fodor, P. Kevei, and V. V´ ıgh, On random disc polygons in a disc-polygon (2021), in preparation

    work page 2021

  10. [10]

    Fodor and V

    F. Fodor and V. V´ ıgh,Variance estimates for random disc-polygons in smooth convex discs , J. Appl. Probab. 55 (2018), no. 4, 1143–1157

    work page 2018

  11. [11]

    P. M. Gruber, Convex and discrete geometry , Grundlehren der Mathematischen Wis- senschaften [Fundamental Principles of Mathematical Sciences], vol. 336, Springer, Berlin, 2007

    work page 2007

  12. [12]

    Gr¨ unfelder,Variance estimates for generalized random polygons , MSc thesis, University of Szeged, Hungary, 2021 (Hungarian)

    B. Gr¨ unfelder,Variance estimates for generalized random polygons , MSc thesis, University of Szeged, Hungary, 2021 (Hungarian). Also in the student competition paper ”The variance of the area of random disc-polygons”

    work page 2021

  13. [13]

    Reitzner, Random polytopes, New perspectives in stochastic geometry, Oxford Univ

    M. Reitzner, Random polytopes, New perspectives in stochastic geometry, Oxford Univ. Press, Oxford, 2010, pp. 45–76

    work page 2010

  14. [14]

    Reitzner, Random polytopes and the Efron–Stein jackknife inequality , Ann

    M. Reitzner, Random polytopes and the Efron–Stein jackknife inequality , Ann. Probab. 31 (2003), 2136–2166

    work page 2003

  15. [15]

    Reitzner, The combinatorial structure of random polytopes, Adv

    M. Reitzner, The combinatorial structure of random polytopes, Adv. Math. 191 (2005), no. 1, 178–208

    work page 2005

  16. [16]

    Reitzner, Central limit theorems for random polytopes , Probab

    M. Reitzner, Central limit theorems for random polytopes , Probab. Theory Related Fields 133 (2005), no. 4, 483–507

    work page 2005

  17. [17]

    R´ enyi and R

    A. R´ enyi and R. Sulanke, Zuf¨ allige konvexe Polygone in einem Ringgebiet, Z. Wahrschein- lichkeitstheorie und Verw. Gebiete 9 (1968), 146–157 (German)

    work page 1968

  18. [18]

    R´ enyi and R

    A. R´ enyi and R. Sulanke, ¨Uber die konvexe H¨ ulle von n zuf¨ allig gew¨ ahlten Punkten. II, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 3 (1964), 138–147 (1964) (German)

    work page 1964

  19. [19]

    R´ enyi and R

    A. R´ enyi and R. Sulanke, ¨Uber die konvexe H¨ ulle von n zuf¨ allig gew¨ ahlten Punkten, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2 (1963), 75–84 (1963) (German)

    work page 1963

  20. [20]

    Schneider, Convex bodies: the Brunn-Minkowski theory, Second expanded edition, Encyclo- pedia of Mathematics and its Applications, vol

    R. Schneider, Convex bodies: the Brunn-Minkowski theory, Second expanded edition, Encyclo- pedia of Mathematics and its Applications, vol. 151, Cambridge University Press, Cambridge, 2014

    work page 2014

  21. [21]

    Schneider, Discrete aspects of stochastic geometry , Handbook of Discrete and Computa- tional Geometry (2017), 299–329

    R. Schneider, Discrete aspects of stochastic geometry , Handbook of Discrete and Computa- tional Geometry (2017), 299–329

    work page 2017

  22. [22]

    Turchi and F

    N. Turchi and F. Wespi, Limit theorems for random polytopes with vertices on convex sur- faces, Adv. in Appl. Probab. 50 (2018), no. 4, 1227–1245

    work page 2018

  23. [23]

    Th¨ ale, N

    C. Th¨ ale, N. Turchi, and F. Wespi, Random polytopes: central limit theorems for intrinsic volumes, Proc. Amer. Math. Soc. 146 (2018), no. 7, 3063–3071. Department of Geometry, Bolyai Institute, University of Szeged, Aradi v ´ertan´uk tere 1, 6720 Szeged, Hungary Email address: fodorf@math.u-szeged.hu University of Szeged, Aradi v ´ertan´uk tere 1, 6720 ...

    work page 2018