Derives maximal inequalities and Glivenko-Cantelli results for graph-dependent empirical processes showing that convergence rates are jointly determined by function-class complexity, graph geometry, and dependence decay rather than always following a generic root-n rate.
Empirical process techniques for dependent data , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coupling and Maximal Inequalities for Graph-Dependent Empirical Processes
Derives maximal inequalities and Glivenko-Cantelli results for graph-dependent empirical processes showing that convergence rates are jointly determined by function-class complexity, graph geometry, and dependence decay rather than always following a generic root-n rate.