Recurrence of the $\mathbb{Z}^d$-valued infinite snake via unimodularity
Electronic Communications in Probability · 01.01.2012 · 17 (none) · 1-10
DOI: 10.1214/ecp.v17-1700 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Communications in Probability, erschienen am 01.01.2012. Verfasst von Itai Benjamini und 1 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
We use the concept of unimodular random graph to show that the branching simple random walk on $\mathbb{Z}^{d}$ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if $d \leq 4$.
Zitieren
APA
Benjamini, I., & Curien, N. (2012). Recurrence of the $\mathbb{Z}^d$-valued infinite snake via unimodularity. Electronic Communications in Probability, 17(none), 1-10. https://doi.org/10.1214/ecp.v17-1700
Vancouver
Benjamini I, Curien N. Recurrence of the $\mathbb{Z}^d$-valued infinite snake via unimodularity. Electronic Communications in Probability. 2012;17(none):1-10. doi:10.1214/ecp.v17-1700
BibTeX
@article{Benjamini2012,
author = {Benjamini, Itai and Curien, Nicolas},
title = {Recurrence of the $\mathbbZ^d$-valued infinite snake via unimodularity},
journal = {Electronic Communications in Probability},
year = {2012},
volume = {17},
number = {none},
pages = {1--10},
doi = {10.1214/ecp.v17-1700}
}
EUVIMED