Record times for coverage thresholds and maximal spacings
Mathew D. Penrose
Abstract
Let X1,X2, … be independent uniform random points in a bounded region A ⊂ Rd having a smooth boundary, d ≥ 1. Let B ⊂ A be compact. The coverage threshold of B, Rn, is the smallest r such that B is covered by the balls of radius r centred on X1,…,Xn. The maximal spacing Rn is the volume of the largest ball contained in A \X1,…,Xn\. We investigate the asymptotic frequency of record times in the sequence (Rn), that is times n for which Rn < Rn-1. Let Nm denote the number of records in the sequence (Rn) up to time m, and let νm be the time at which the mth record value of the sequence (Rn) occurs. For B ⊂ Ao, we show that almost surely, Nn 12 ( n)2 and νn1/n (2\: ) as n ∞, and likewise for Nn and νn, defined analogously in terms of (Rn). But if B=A and d ≥ 3, then Nn 12 (1- 1d) ( n)2 and νn1/n ( 2d/(d-1) \: ). We also discuss the generalization (for fixed k ∈ N) to k-coverage thresholds, maximal k-spacings and non-uniformly distributed points Xi in A.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.