Stable fluctuations for biased random walks on Galton–Watson trees

Consider a β\beta-biased random walk with exponent α(1,2)\alpha\in(1,2), where α\alpha is defined at the paper's equation labelled αtree\alpha_{\mathrm{tree}}. Let Δn\Delta_n denote the hitting-time quantity used in the paper, and let vv be the speed. Stable-fluctuation conjecture. There should be no recentering and rescaling of the walk that yields scaling limits. Nevertheless, after recentering Δn\Delta_n by the inverse of the speed and rescaling by n1/αn^{1/\alpha}, the resulting sequence should be tight and should converge along exponential subsequences to an infinitely divisible distribution. The statement describes the expected non-Gaussian fluctuation regime for the tree walk; its precise formulation depends on the paper's definitions of Δn\Delta_n, the speed, and α\alpha.

Sources & referencesView supporting material

Primary source

Gerard Ben Arous and Alexander Fribergh, “Biased random walks on random graphs”, arXiv:1406.5076 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.