## The Annals of Probability

### Painting a graph with competing random walks

Jason Miller

#### Abstract

Let $X_{1}$, $X_{2}$ be independent random walks on $\mathbf{Z} _{n}^{d}$, $d\geq3$, each starting from the uniform distribution. Initially, each site of $\mathbf{Z} _{n}^{d}$ is unmarked, and, whenever $X_{i}$ visits such a site, it is set irreversibly to $i$. The mean of $|\mathcal{A} _{i}|$, the cardinality of the set $\mathcal{A} _{i}$ of sites painted by $i$, once all of $\mathbf{Z} _{n}^{d}$ has been visited, is $\frac{1}{2}n^{d}$ by symmetry. We prove the following conjecture due to Pemantle and Peres: for each $d\geq3$ there exists a constant $\alpha_{d}$ such that $\lim_{n\to\infty}\operatorname{Var} (|\mathcal{A} _{i}|)/h_{d}(n)=\frac{1}{4}\alpha_{d}$ where $h_{3}(n)=n^{4}$, $h_{4}(n)=n^{4}(\log n)$ and $h_{d}(n)=n^{d}$ for $d\geq5$. We will also identify $\alpha_{d}$ explicitly and show that $\alpha_{d}\to1$ as $d\to\infty$. This is a special case of a more general theorem which gives the asymptotics of $\operatorname{Var} (|\mathcal{A} _{i}|)$ for a large class of transient, vertex transitive graphs; other examples include the hypercube and the Caley graph of the symmetric group generated by transpositions.

#### Article information

Source
Ann. Probab., Volume 41, Number 2 (2013), 636-670.

Dates
First available in Project Euclid: 8 March 2013

Permanent link to this document
https://projecteuclid.org/euclid.aop/1362750937

Digital Object Identifier
doi:10.1214/11-AOP713

Mathematical Reviews number (MathSciNet)
MR3077521

Zentralblatt MATH identifier
1271.05091

#### Citation

Miller, Jason. Painting a graph with competing random walks. Ann. Probab. 41 (2013), no. 2, 636--670. doi:10.1214/11-AOP713. https://projecteuclid.org/euclid.aop/1362750937