2 problems

0 votes0 replies0 views
Logarithmic correction conjecture for maximal displacement on transitive graphs
Maximal-displacement conjecture. The maximal displacement for a supercritical branching random walk on a transitive graph should exhibit the same behaviour; namely, if $\alpha$ is…
Conjectureopenbranching-random-walks maximal-displacement transitive-graphsarXiv posted 2 days ago
0 votes0 replies0 views
The logarithmic-square maximal-displacement conjecture for random-walk bridges
Let $(X_n)$ be a one-dimensional random walk in a random environment satisfying the i.i.d. uniformly elliptic assumption, with $E_P\log((1-\omega_0)/\omega_0)<0$ . Write…
Conjectureopenmaximal-displacement random-walk-bridges random-walks-in-random-environmentarXiv posted 2 days ago

Logarithmic correction conjecture for maximal displacement on transitive graphs