On μ-Dvoretzky random covering of the circle

Bernoulli ◽  
2021 ◽  
Vol 27 (2) ◽  
Author(s):  
Aihua Fan ◽  
Davit Karagulyan
Keyword(s):  
2001 ◽  
Vol 63 (6) ◽  
Author(s):  
Marcelo S. Nascimento ◽  
Maurício D. Coutinho-Filho ◽  
Carlos S. O. Yokoi

2018 ◽  
Vol 46 (3) ◽  
pp. 1542-1596 ◽  
Author(s):  
De-Jun Feng ◽  
Esa Järvenpää ◽  
Maarit Järvenpää ◽  
Ville Suomala

1988 ◽  
Vol 43 (1) ◽  
pp. 2184-2186
Author(s):  
E. A. Begovatov
Keyword(s):  

2003 ◽  
Vol 35 (03) ◽  
pp. 563-582 ◽  
Author(s):  
Thierry Huillet

Consider a circle of circumference 1. Throw n points at random onto this circle and append to each of these points a clockwise arc of length s. The resulting random set is a union of a random number of connected components, each with specific size. Using tools designed by Steutel, we compute the joint distribution of the lengths of the connected components. Asymptotic results are presented when n goes to ∞ and s to 0 jointly according to different regimes.


Sign in / Sign up

Export Citation Format

Share Document