Cutting out a circle using circles Let $X_0$ be the unit disc, and consider the process of "cutting out circles", where to construct $X_n$ you select a uniform random point $x \in X_{n-1}$, and cut out the largest circle with center $x$. To illustrate this process, we have the following graphic:

where the graphs are respectively showing one sample of $X_1,X_2,X_3,X_{100}$ (the orange parts have been cut out).
Can we prove we eventually cut everything out? Formally, is the following true
$$\text{lim}_{n \to \infty} \mathbb{E}[\text{Area}(X_n)] = 0$$
where $\mathbb{E}$ denotes we are taking the expectation value. Doing simulations, this seems true, in fact $\mathbb{E}[\text{Area}($X_n$)]$ seems to decay with some power law, but after 4 years I still don't really know how to prove this :(. The main thing you need to rule out is that $X_n$ doesn't get too skinny too quickly, it seems.
 A: New to this, so not sure about the rigor, but here goes.
Let $A_k$ be the $k$th circle. Assume the area of $\bigcup_{k=1}^n A_k$ does not approach the total area of the circle $A_T$ as $n$ tends towards infinity. Then there must be some area $K$ which is not covered yet cannot harbor a new circle. Let $C = \bigcup_{k=1}^\infty A_k$. Consider a point $P$ in such that $d(P,K)=0$ and $d(P,C)>0$. If no such point exists, then $K \subset C$, as $C$ is a clearly a closed set of points. If such a point does exist, then another circle with center $P$ and nonzero area can be made to cover part of $K$, and the same logic applies to all possible $K$. Therefore there is no area $K$ which cannot contain a new circle, and by consequence $$\lim_{n\to\infty}\Bigg[\bigcup_{k=1}^n A_k\Bigg] = \big[A_T\big]$$
Since the size of circles is continuous, there must be a set of circles $\{A_k\}_{k=1}^\infty$ such that $\big[A_k\big]=E(\big[A_k\big])$ for each $k \in \mathbb{N}$, and therefore $$\lim_{n\to\infty} E(\big[A_k\big]) = \big[A_k\big] $$
EDIT: This proof is wrong becuase I'm bad at probability, working on a new one.
A: This is not a complete answer but is too lengthy for a comment. This problem is similar to the problems of statistical geometry. There, it is proposed that you can fill an arbitrary region on the plane with another shape (or shapes) that decrease in size according to a power law. The foundations of statistical geometry are laid out in a book by its developer, John Shier: Fractalize That! : A Visual Essay On Statistical Geometry, World Scientific, 2018 (available at Amazon).
I, myself, have made many such calculations. Several examples can found at Pinterest.
Now, the catch is that this cannot be proven (so far) other than for the simple case of circles within a circular disk. This was published by Christopher Evens, "(Always) Room for One More," Math Horizons, February 2016. This might be just what you need.
A: Suppose our sample space is the open unit disk $\Bbb{D}$ with the usual uniform (Lebesgue) probability measure. To show that it's practically certain that the non-removed area tends to zero, we begin by constructing a sequence of random variables $R_n$, $n \geq 0$, on $\Bbb{D}$ as follows. (The following argument also works for any open set of finite area.)
Before we start slicing out our random disks, we initialize our random variables $R_0: \Bbb{D} \to [0, 1]$ so that, for any point $x \in \Bbb{D}$, $R_0(x)$ is the distance from $x$ to the edge of $\Bbb{D}$, i.e. $R_0(x)$ is the radius of the largest possible disk contained in $\Bbb{D}$ centered at $x$.
At each stage $n$, $n \geq 1$, we then select a point $x \in \Bbb{D}$ uniformly at random, and remove the disk of radius $R_{n-1}(x)$ centered at $x$. $R_n(y)$ is then defined to be $0$ for points $y$ in the removed disk, and updated to be the infimum distance from $y$ to any previously removed point (or the edge of $\Bbb{D}$) otherwise. If for some $y$, all the newly removed points are more than $R_{n-1}(y)$ away from $y$, then we set $R_n(y) = R_{n-1}(y)$.
Note that because our selections take place uniformly at random on $\Bbb{D}$, we may at some stage $n$ select a point $x$ for which $R_{n-1}(x) = 0$ (i.e. $x$ was already removed). In this case, no new disks are removed, $R_n(x)$ is defined to equal $R_{n-1}(x)$ for all points $x \in \Bbb{D}$, and we pick again.
These steps where "nothing happens" have no effect on the end result that all the area of $\Bbb{D}$ is eventually removed, although they grow increasingly frequent as the removed area takes up a larger and larger percentage of $\Bbb{D}$. The convenience of including these "do-nothing" steps is that we don't have to restrict our sample space at each new stage to only select from the non-removed points where $R_{n-1} > 0$.
We then have, for all $x \in \Bbb{D}$, $$R_0(x) \geq R_1(x) \geq R_2(x) \geq ... \geq 0.$$ The area of the remaining circle centered at $x$ at stage $n$ is $\pi R_n(x)^2$. The removed region at any stage $n$ is connected and closed; the non-removed region at stage $n$ is open. Let $C_0 = \emptyset$ and $C_n$ be the removed region at stage $n$; let $U_0 = \Bbb{D}$ and $U_n = \Bbb{D} \setminus C_n$ be the non-removed region. Since the area of $C_n$ is $\pi \Bbb{P}(C_n)$ and the area of $U_n$ is $\pi \Bbb{P}(U_n)$, it suffices to show that $\Bbb{P}(U_n) \to 0$ with probability $1$. If the points chosen in $\Bbb{D}$ at each stage are $X_1, X_2, X_3, ...$ then we have
\begin{align*}
\Bbb{P}(C_n) &= R_1(X_1)^2 + ... + R_n(X_n)^2 \\
\Bbb{P}(U_n) &= 1 - R_1(X_1)^2 + ... + R_n(X_n)^2 \
\end{align*}
We first note that for any point $p \in \Bbb{U_{n-1}}$, $$\Bbb{P}(R_n(p) \leq \frac{1}{2} R_{n-1}(p) | X_n \in B(p, R_{n-1}(p)) = 9/16,$$ because if $X_n$ lands closer to $p$ in $R_{n-1}(p)$ than $\frac{3}{4}R_{n-1}(p)$, the radius $R_{n-1}(X_n) \geq \frac{1}{2}R_{n-1}(p)$ (draw a picture to see this). Since $\Bbb{D}$ and $U_n$ are both separable, we can cover them with a countable union of open balls $B(p_n, R_{n-1}(p_n))$. The infinite monkey theorem then tells us that almost surely, the area of any of the countably many open balls in $U_i$ is at some stage $n \geq i$ reduced by a factor of at least $(1 - (1/4)^2) = 15/16$. Since a countable intersection of almost sure events is almost sure, this implies that this happens for every open ball in $U_i$, and hence the area of $U_i$ is in the long term multiplied by a factor of at most $15/16$ with probability 1. In other words, if we let $U_\infty := \cap_n U_n$, then this means $\Bbb{P}(U_\infty) < 15/16 \Bbb{P}(U_n)$ with probability $1$ for all $n$.
We're close to the end here. Let $\pi L$ be the limiting area of $U_\infty$, so $L$ is the limiting probability of $U_\infty$. This means for any $\epsilon$, there exists $n$ so that the area of $U_n$, which we call $\pi L_n$, is at most $\epsilon$ greater than the area of $U_\infty$: $\pi L_n \leq \pi L + \epsilon$. But we know that with probability $1$, the area of $U_n$ will be reduced by a factor of at least $15/16$ in the limit, which means $\frac{15}{16} \pi L_n \geq \pi L$. Therefore $15/16 \pi L + 15/16 \epsilon > \pi L$ for every epsilon with probability $1$, which (since $L$ is nonnegative) is only possible if $L = 0$. $\blacksquare$
