We study the number of k-cycles in a random graph G(n, p). We estimate the probability that a random graph contains more k-cycles than expected. In this case, the usual martingale inequality with bounded difference is not effective. By construct-ing a variable that approximates to the number of k-cycles in a random graph and using a new and extensive martingale inequality, we get the results in this paper.
展开▼
机译:Stereotactic Ablative Radiotherapy versus Lobectomy for Operable Stage I Non-small-cell Lung Cancer: A Pooled Analysis of Two Randomized Trials——胸外科医生的解读