Metraipolis › archive › dc_62fcb17c5803

Limit Theory for U-Statistics under Clustered and Weakly Dependent Data — arXiv:2608.18443

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.18443
License (as archived)
CC0-1.0
Archived
2026-10-18T14:23:44.623Z
SHA-256 of the archived text
5cce99560d4c456974871552afdf014ec4ee29a36066675771155e145769895f
Stable URL of this page
https://metraipolis.com/documento/dc_62fcb17c5803

How to cite

Limit Theory for U-Statistics under Clustered and Weakly Dependent Data — arXiv:2608.18443 — arXiv (en), https://arxiv.org/abs/2608.18443 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62fcb17c5803 (Metraipolis archive dc_62fcb17c5803, sha256 5cce99560d4c456974871552afdf014ec4ee29a36066675771155e145769895f)
BibTeX
@misc{dc62fcb17c5803,
  title = {Limit Theory for U-Statistics under Clustered and Weakly Dependent Data — arXiv:2608.18443},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.18443},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62fcb17c5803; sha256 5cce99560d4c456974871552afdf014ec4ee29a36066675771155e145769895f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18443. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper develops asymptotic theory and feasible inference for unbounded-kernel order-k U-statistics under clustered sampling and weakly dependent time-series. The analysis first builds the complete order-2 pipeline, moving from clustered data to exact $m$-dependence and then to near-epoch dependence. The same logic is subsequently extended to general order k greater or equal to 2. Under clustered sampling, the theory allows arbitrary within-cluster dependence and growing, unbalanced cluster sizes. Under weak dependence, an i.i.d.-based approximating sequence carries the exact-m theory to near-epoch-dependent processes. The common combinatorial device partitions the sample into columns, separating sampling-generic tuples, where the first-order Hoeffding projection is analysed, from collision terms and higher-order Hoeffding projection remainders, which are controlled explicitly. Cluster-robust and HAC estimators of the covariance of the first-order projection, needed for feasible inference, are shown to be consistent. Empirical applications and data-calibrated simulations for inequality, L-moment, and rank-dependence statistics illustrate the finite-sample performance of the proposed procedures.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-20 in econ.EM).
Categorie arXiv: Econometrics (econ.EM) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2608.18443 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:21:30.353Z dalla pagina https://arxiv.org/catchup/econ.EM/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).