A concentration result with application to subgraph count

Details A concentration result with application to subgraph count A concentration result with application to subgraph count

2009-12-19

arxiv.org/abs/0912.3868v1

Mathematics

Combinatorics

11 pages

Scientific paper

Let H = (V,E) be a k-uniform hypergraph with a vertex set V and an edge set E. Let V_p be constructed by taking every vertex in V independently with probability p. Let X be the number of edges in E that are contained in V_p. We give a condition that guarantees the concentration of X within a small interval around its mean. The applicability of this result is demonstrated by deriving new sub-Gaussian tails for the number of copies of small complete and complete bipartite graphs in the binomial random graph, extending results of Ruci\'nski and Vu.

Affiliated with

Also associated with

No associations

Rating

A concentration result with application to subgraph count does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A concentration result with application to subgraph count, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A concentration result with application to subgraph count will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381834