Deviation inequality for monotonic Boolean functions with application to the number of k‐cycles in a random graph
暂无分享,去创建一个
[1] S. Janson,et al. Upper tails for subgraph counts in random graphs , 2004 .
[2] Van H. Vu,et al. Divide and conquer martingales and the number of triangles in a random graph , 2004, Random Struct. Algorithms.
[3] S. Boucheron,et al. Concentration inequalities using the entropy method , 2003 .
[4] Van H. Vu,et al. Concentration of non‐Lipschitz functions and applications , 2002, Random Struct. Algorithms.
[5] Svante Janson,et al. The infamous upper tail , 2002, Random Struct. Algorithms.
[6] Van H. Vu,et al. A Large Deviation Result on the Number of Small Subgraphs of a Random Graph , 2001, Combinatorics, Probability and Computing.
[7] J. Kahn,et al. On the number of copies of one hypergraph in another , 1998 .
[8] M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.