Large deviations for sums of partly dependent random variables

Authors:
Svante Janson
Affiliations:
Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden
Venue:
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
Year:
2004

Citing 0
Cited 9

Balanced metric labeling

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hidden word statistics

Journal of the ACM (JACM)
t-Wise independence with local dependencies

Information Processing Letters
On-Line Approximate String Matching with Bounded Errors

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary β-Mixing Processes

The Journal of Machine Learning Research
Penalized cluster analysis with applications to family data

Computational Statistics & Data Analysis
On-line approximate string matching with bounded errors

Theoretical Computer Science
No sublogarithmic-time approximation scheme for bipartite vertex cover

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Building one-time memories from isolated qubits: (extended abstract)

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use and extend a method by Hoeffding to obtain strong large deviation bounds for sums of dependent random variables with suitable dependency structure. The method is based on breaking up the sum into sums of independent variables. Applications are given to U-statistics, random strings and random graphs. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004