A Bernstein Inequality For Exponentially Growing Graphs
classification
🧮 math.ST
stat.TH
keywords
inequalitybernsteinnetworksarticleconcentrationconditionalconsistencydefined
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.