Timeline for On the speed of divergence of the converse of the Strong law of large numbers
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2020 at 21:37 | vote | accept | Kernel | ||
| Jul 19, 2020 at 21:34 | vote | accept | Kernel | ||
| Jul 19, 2020 at 21:37 | |||||
| Jul 18, 2020 at 19:37 | answer | added | Yuval Peres | timeline score: 2 | |
| Jul 15, 2020 at 11:04 | comment | added | Kernel | Sorry, just fixed the n/N situation. Also, it was supposed to be limsup, not liminf. But I am referring to the limsup of events, putting in words I want to prove that $[S_N > C\cdot a_N]$ only happen a finite (but random) ammount of times almost surely. | |
| Jul 15, 2020 at 11:00 | history | edited | Kernel | CC BY-SA 4.0 |
change from liminf to limsup, and n to N
|
| Jul 15, 2020 at 10:46 | comment | added | user44143 | I’m confused by the notation at the end — are you taking a liminf of an inequality, and is it with respect to $n$ or $N$? Also, can you provide a sequence that works if the variables are standard normals? | |
| Jul 15, 2020 at 10:02 | history | asked | Kernel | CC BY-SA 4.0 |