Concentration of non-Lipschitz functions and applications

被引：60
作者：
Vu, VH [1 ]
机构：
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
[2] Microsoft Corp, Res, Redmond, WA 98052 USA
来源：
RANDOM STRUCTURES & ALGORITHMS | 2002年 / 20卷 / 03期
关键词：
D O I：
10.1002/rsa.10032
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random graphs. (C) 2002 Wiley Periodicals, Inc.
引用
收藏
页码：262 / 316
页数：55
相关论文
共 83 条
[1]  
ABATANGELO V, 1983, ARS COMBINATORIA, V16, P103
[2]  
Ajtai M., 1981, EUR J COMBIN, V2, P1
[3]   Nearly perfect matchings in regular simple hypergraphs [J].
Alon, N ;
Kim, JH ;
Spencer, J .
ISRAEL JOURNAL OF MATHEMATICS, 1997, 100 (1) :171-187
[4]   Coloring graphs with sparse neighborhoods [J].
Alon, N ;
Krivelevich, M ;
Sudakov, B .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 77 (01) :73-82
[5]  
Alon N., 2000, PROBABILISTIC METHOD
[6]  
ALON N, UNPUB LIST COLORING
[7]  
ALON N, UNPUB EC COVERS GEOM
[8]  
Alon N., 1993, LONDON MATH SOC LECT, V187, P1
[9]  
[Anonymous], RANDOM GRAPHS
[10]   On small complete arcs in a finite plane [J].
Ball, S .
DISCRETE MATHEMATICS, 1997, 174 (1-3) :29-34
123456789