On sums of independent random variables with unbounded variance and estimating the average degree in a graph

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 964-984

  Feige, Uriel ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Markov inequality; Shortest paths

Indexed keywords

CONSTANT FACTORS; MARKOV INEQUALITY; RANDOM VARIABLES; SHORTEST PATHS;

APPROXIMATION THEORY; GRAPH THEORY; INTEGER PROGRAMMING; PARAMETER ESTIMATION; PROBABILITY; PROBLEM SOLVING;

VARIATIONAL TECHNIQUES;

EID: 33747204117     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704447304     Document Type: Conference Paper

References (8)

1. N. ALON AND J. SPENCER, The Probabilistic Method, Wiley-Interscience, New York, 2000.
2. Z. W. BIRNBAUM, J. RAYMOND, AND H. S. ZUCKERMAN, A generalization of Tshebyshev's inequality to two dimensions, Ann. Math. Statist., 18 (1947), pp. 70-79.
3. N. DEVANUR, R. LIPTON, AND N. VISHNOI, Who's the weakest link?, in Stochastic Algorithms: Foundations and Applications, Lecture Notes in Comput. Sci. 2827, A. Albrecht and K. Steinhöfel, eds., Springer, Berlin, 2003, pp. 108-116.
4. L. DUBINS AND L. SAVAGE, Inequalities for Stochastic Processes (How to Gamble if You Must), Dover, New York, 1976.
5. O. GOLDREICH AND D. RON, On Estimating the Average Degree of a Graph, Electronic Colloquium on Computational Complexity (ECCC), Report TR04-13, 2004.
6. S. M. SAMUELS, On a Chebyshev-type inequality for sums of independent random variables, Ann. Math. Statist., 37 (1966), pp. 248-259.
7. S. M. SAMUELS, The Markov inequality for sums of independent random variables, Ann. Math. Statist. 40 (1969), pp. 1980-1984.
8. A. SIEGEL, Median bounds and their application, J. Algorithms, 38 (2001), pp. 184-236.