Centering Sequences with Bounded Differences

Authors:
Colin McDiarmid
Affiliations:
Department of Statistics, University of Oxford, Oxford, UK
Venue:
Combinatorics, Probability and Computing
Year:
1997

Citing 2
Cited 1

Algorithms (2nd ed.)

Algorithms (2nd ed.)
Tail bounds for occupancy and the satisfiability threshold conjecture

Random Structures & Algorithms

The power of convex relaxation: near-optimal matrix completion

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

Inequalities for martingales with bounded differences have recently proved to be very useful in combinatorics and in the mathematics of operational research and computer science. We see here that these inequalities extend in a natural way to ‘centering sequences’ with bounded differences, and thus include, for example, better inequalities for sequences related to sampling without replacement.