Bull. Korean Math. Soc. 2019; 56(5): 1199-1210
Online first article July 18, 2019 Printed September 30, 2019
https://doi.org/10.4134/BKMS.b180971
Copyright © The Korean Mathematical Society.
Yilun Shang
Northumbria University
In this paper, we consider a class of inhomogeneous random intersection graphs by assigning random weight to each vertex and two vertices are adjacent if they choose some common elements. In the inhomogeneous random intersection graph model, vertices with larger weights are more likely to acquire many elements. We show the Poisson convergence of the number of induced copies of a fixed subgraph as the number of vertices $n$ and the number of elements $m$, scaling as $m=\lfloor\beta n^{\alpha}\rfloor$ $(\alpha,\beta>0)$, tend to infinity.
Keywords: random graph, intersection graph, Poisson approximation, Stein's method, subgraph count
MSC numbers: Primary 60F05, 05C80, 62E17
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd