| This PhD thesis is devoted to random covering theory; we study the covering property of a set by a union of randomly placed sets, and focus mainly on the condition for almost sure coverage of every point of the set. A. Dvoretzky initiated this direction of research by proving that covering every fixed point with probability 1 does not necessarily imply that every point is covered with probability 1 when the set to be covered is uncountable, by giving an example where covering every point in a unit circumference circle almost surely does not imply covering the whole circle [6]. Since then, to study this phenomenon, several settings have been proposed; we concentrate on two of these, the Dvoretzky problem and the Mandelbrot problem.;For the Dvoretzky problem, let C be a convex set and let {vn} be a sequence of volumes of scaled copies of C that are placed uniformly on the d-dimensional torus. We find a necessary condition and also a sufficient condition for the union of the sets to cover a fixed k-dimensional hyperplane, k > 0. Furthermore, a necessary and sufficient condition is also obtained for the special case when k = 1.;For the Mandelbrot problem, let C be a convex set with volume 1 in Rd , and let each point (x, z), where x ∈ Rd and z ∈ R+ be associated with a convex set x + zC . Let Φ be a Poisson point process in Rd×R + with intensity λ ⊗ µ, where λ is a Lebesgue measure and µ is a σ-finite measure. We give a necessary condition and also a sufficient condition on µ for the union of all convex sets associated with points in Φ to cover any k-dimensional hyperplane in Rd . Furthermore, a necessary and sufficient condition is also obtained for the special case when k = 1.;We also consider covering a more general set. In particular, we derive a necessary condition and also a sufficient condition for covering a Cantor set and its generalized version in the one-dimensional Mandelbrot problem setting. |
