Central limit theorem for biased random walk on multi-type Galton-Watson trees
| Dublin Core | PKP Metadata Items | Metadata for this Document | |
| 1. | Title | Title of document | Central limit theorem for biased random walk on multi-type Galton-Watson trees |
| 2. | Creator | Author's name, affiliation, country | Amir Dembo; Standford University; United States |
| 2. | Creator | Author's name, affiliation, country | Nike Sun; Stanford University; United States |
| 3. | Subject | Discipline(s) | |
| 3. | Subject | Keyword(s) | Multi-type Galton-Watson tree; biased random walk; central limit theorem; random walk with random environment |
| 3. | Subject | Subject classification | 60F05; 60K37; Secondary 60J80; 60G50 |
| 4. | Description | Abstract | Let $\mathcal{T}$ be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The $\lambda$-biased random walk $(X_t)_{t\ge0}$ on $\mathcal{T}$ is the nearest-neighbor random walk which, when at a vertex $v$ with $d_v$ offspring, moves closer to the root with probability $\lambda/(\lambda+d_v)$, and to each of the offspring with probability $1/(\lambda+d_v)$. This walk is recurrent for $\lambda\ge\rho$ and transient for $0\le\lambda<\rho$, with $\rho$ the Perron-Frobenius eigenvalue for the (assumed) irreducible matrix of expected offspring numbers. Subject to finite moments of order $p>4$ for the offspring distributions, we prove the following quenched CLT for $\lambda$-biased random walk at the critical value $\lambda=\rho$: for almost every $\mathcal{T}$, the process $|X_{\lfloor nt \rfloor}|/\sqrt{n}$ converges in law as $n\to\infty$ to a reflected Brownian motion rescaled by an explicit constant. This result was proved under some stronger assumptions by Peres-Zeitouni (2008) for single-type Galton-Watson trees. Following their approach, our proof is based on a new explicit description of a reversing measure for the walk from the point of view of the particle (generalizing the measure constructed in the single-type setting by Peres-Zeitouni), and the construction of appropriate harmonic coordinates. In carrying out this program we prove moment and conductance estimates for MGW trees, which may be of independent interest. In addition, we extend our construction of the reversing measure to a biased random walk with random environment (RWRE) on MGW trees, again at a critical value of the bias. We compare this result against a transience-recurrence criterion for the RWRE generalizing a result of Faraud (2011) for Galton-Watson trees. |
| 5. | Publisher | Organizing agency, location | |
| 6. | Contributor | Sponsor(s) | |
| 7. | Date | (YYYY-MM-DD) | 2012-09-06 |
| 8. | Type | Status & genre | Peer-reviewed Article |
| 8. | Type | Type | |
| 9. | Format | File format | |
| 10. | Identifier | Uniform Resource Identifier | http://ejp.ejpecp.org/article/view/2294 |
| 10. | Identifier | Digital Object Identifier | 10.1214/EJP.v17-2294 |
| 11. | Source | Journal/conference title; vol., no. (year) | Electronic Journal of Probability; Vol 17 |
| 12. | Language | English=en | en |
| 14. | Coverage | Geo-spatial location, chronological period, research sample (gender, age, etc.) | |
| 15. | Rights | Copyright and permissions | The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available. Summary of the Creative Commons Attribution License You are free
|