An Exact Asymptotic for the Square Variation of Partial Sum Processes
Allison Lewko, Mark Lewko

TL;DR
This paper derives an exact asymptotic formula for the maximum square variation of partial sum processes of i.i.d. mean-zero variables, refining the law of the iterated logarithm with a variational approach.
Contribution
It establishes a precise asymptotic behavior for the square variation of partial sums, extending classical results to a variational setting with almost sure convergence.
Findings
Max square variation asymptotically behaves as 2σ²N ln ln(N).
Results refine the law of the iterated logarithm for partial sums.
Provides a weaker in-probability version when δ=0.
Abstract
We establish an exact asymptotic formula for the square variation of certain partial sum processes. Let be a sequence of independent, identically distributed mean zero random variables with finite variance and satisfying a moment condition for some . If we let denote the set of all possible partitions of the interval into subintervals, then we have that holds almost surely. This can be viewed as a variational strengthening of the law of the iterated logarithm and refines results of J. Qian on partial sum and empirical processes. When , we obtain a weaker `in probability' version of the result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
