arXiv (All)
open access
Limit Laws of the Iterated Logarithm Under Sub-linear Expectations
Let $\{Y_n; n\ge 1\}$ be a sequence of independent and identically distributed random variables with mean zero in Peng's framework of the sub-linear expectation space $(Ω,\mathscr{H},\widehat{\mathbb E})$, and $S_n=\sum_{i=1}^nY_i$. In this paper, we establish a limit law of \begin{align*}\lim_{n\to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Finite-Entropy Criterion for the Entropic Conditional Central Limit Theorem#799769
- An Erd\H os Rényi Law for the Longest Consecutive Monotone Block in a Random Permutation#1035405
- Nonuniform expansion and diffusive noise imply random horseshoes and random Young towers#986772
- A Perron-Frobenius comonotonic approximation for sums of lognormals#973724
- Mesoscopic eigenvalue statistics for correlated random matrices#1142739
Record · ID 926224
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive