  We consider invasion percolation on the square lattice. It has been proved by
van den Berg, Peres, Sidoravicius and Vares, that the probability that the
radius of a so-called pond is larger than n, differs at most a factor of order
log n from the probability that in critical Bernoulli percolation the radius of
an open cluster is larger than n. We show that these two probabilities are, in
fact, of the same order. Moreover, we prove an analogous result for the volume
of a pond.
