arXiv (All)
open access
Discrete total variation under the multinomial, Part 2: variance under the uniform null
For the counts $(X_1,\dots,X_n)\sim\mathrm{Mult}(N;1/n,\dots,1/n)$ of $N$ observations in $n$ ordered bins we study the variance of the discrete total variation $d=\sum_{i=1}^{n-1}|X_{i+1}-X_i|$. An exact decomposition splits $\mathrm{Var}(d)$ into per-edge, adjacent-pair and disjoint-pair terms and
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
- Sharp Cramér-type moderate deviation bounds for the self-normalized maximum of partial sums#1357630
- Logarithmic Large Deviations for Heavy-Tailed Randomly Stopped Sums#1061730
- Rounding the Ball LP for Fair Max-Min Diversification#1119342
- A subquadratic upper bound for the mixing time of the Thorp shuffle#1344377
- Minimax Rates for Learning Smooth Populations of Parameters#1199409
Record · ID 1341927
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