The Number of Triangles in Random Intersection Graphs  

作　　者：Liang Dong Zhishui Hu 

机构地区：[1]International Institute of Finance,School of Management,University of Science and Technology of China,Hefei,People’s Republic of China

出　　处：《Communications in Mathematics and Statistics》2023年第4期695-725,共31页数学与统计通讯（英文）

基　　金：supported by NSFC (Grant No.11671373).

摘　　要：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.

关 键 词：Random intersection graph Stein’s method Poisson approximation Normal approximation 

分 类 号：O15[理学—数学]