Let Tn be the number of triangles in the random intersection graph G(n,m,p).When the mean of Tn is bounded,we obtain an upper bound on the total variation distance between Tn and a Poisson distribution.When the mean o...Let Tn be the number of triangles in the random intersection graph G(n,m,p).When the mean of Tn is bounded,we obtain an upper bound on the total variation distance between Tn and a Poisson distribution.When the mean of Tn tends to infinity,the Stein–Tikhomirov method is used to bound the error for the normal approximation of Tn with respect to the Kolmogorov metric.展开更多
文摘Let Tn be the number of triangles in the random intersection graph G(n,m,p).When the mean of Tn is bounded,we obtain an upper bound on the total variation distance between Tn and a Poisson distribution.When the mean of Tn tends to infinity,the Stein–Tikhomirov method is used to bound the error for the normal approximation of Tn with respect to the Kolmogorov metric.
