On questions of uniqueness for the vacant set of Wiener sausages and Brownian interlacements

Abstract We consider connectivity properties of the vacant set of (random) ensembles of Wiener sausages in $${\mathbb {R}}^d$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>d</mml:mi> </mml:msup> </mml:math> in the transient dimensions $$d \ge 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> . We prove that the vacant set of Brownian interlacements contains at most one infinite connected component almost surely. For finite ensembles of Wiener sausages, we provide sharp polynomial bounds on the probability that their vacant set contains at least 2 connected components in microscopic balls. The main proof ingredient is a sharp polynomial bound on the probability that several Brownian motions visit jointly all hemiballs of the unit ball while avoiding a slightly smaller ball.