Summary. We are interested in the randomly biased random walk on the supercritical Galton-Watson tree. Our attention is focused on a slow regime when the biased random walk (X n ) is null recurrent, making a maximal displacement of order of magnitude (log n) 3 in the first n steps. We study the localization problem of X n and prove that the quenched law of X n can be approximated by a certain invariant probability depending on n and the random environment. As a consequence, we establish that upon the survival of the system, |Xn| (log n) 2 converges in law to some nondegenerate limit on (0, ∞) whose law is explicitly computed.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.