572 Oberwolfach Report 10/2023 Together with the fact that P A− \cup A+ \in \{0, 1\} (proved in [12]), this puts into focus the following open problem: Problem 1.
Statement
572 Oberwolfach Report 10/2023 Together with the fact that P A− \cup A+ \in {0, 1} (proved in [12]), this puts into focus the following open problem: Problem 1. Is P A+ \in {0, 1}? They are also important in stating several intriguing open questions, described in details in Berger’s lecture in these proceedings. Does the full invariance principle hold under the Bricmont-Kupiainen conditions, for d = 2? limit laws, for s \in (1, 2) there are again stable limit laws (annealed) with a jump- like quenched behavior, and for s > 2 one has a CLT, both quenched and annealed. Unusual large deviations, due to trapping, are also present. We refer to [16] for a bibliographic account up to 2002, and to [8, 10, 13] for further developments. In the case of d \geq 2, an important role is played by regeneration times, which for simplicity we introduce with respect to the preferred direction e1 : those are an increasing sequence of times \taui so that \taui+1 = min n \geq \taui : max{Xt \cdot e1 , t < n} < min{Xt \cdot ei , t \geq n}, i \geq 0 . Denoting by P the annealed law P \times P\omega , it was observed by Sznitman and Zerner that {\omega(x, \cdot)}x:x\cdote1 \in[X\taui \cdote1 ,X\taui+1 \cdotei ) , {Xn }n\in[\taui ,\taui+1 ) forms (under P, for i \geq 1) an iid sequence, which moreover has the same law as for i = 1 (with \tau0 = 0) under P conditioned on no-backtracking, i.e. on not visiting the hyperplane x \cdot e1 < 0. From this, Sznitman-Zerner [15] and Zerner [15] were able to deduce the following theorem. Let A+ = Xn \cdot e1 \to \infty , A− = Xn \cdot e1 \to −\infty . Theorem 1. Xn \cdot e 1 −\to v+ 1A+ + v− 1A− , P-a.s. n n\to\infty
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.