A Bernstein Inequality For Exponentially Growing Graphs

DOI10.1080/03610926.2017.1386317MaRDI QIDQ6281971arXivFDO

Authors Johannes T. N. Krebs

Publication date 16 January 2017

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Asymptotic properties of nonparametric inference (62G20) Inequalities; stochastic orderings (60E15) Stationary stochastic processes (60G10)

Abstract: In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in highly-connected networks. It can be useful to obtain consistency properties for nonparametric estimators of conditional expectation functions which are derived from such networks.

This page was built for publication: A Bernstein Inequality For Exponentially Growing Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281971)