Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

POISSON APPROXIMATION OF INDUCED SUBGRAPH COUNTS IN AN INHOMOGENEOUS RANDOM INTERSECTION GRAPH MODEL

  • Shang, Yilun (Department of Computer and Information Sciences Faculty of Engineering and Environment Northumbria University)
  • Received : 2018.10.10
  • Accepted : 2019.06.26
  • Published : 2019.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

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

References

  1. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford Studies in Probability, 2, The Clarendon Press, Oxford University Press, New York, 1992.
  2. M. Bloznelis, E. Godehardt, J. Jaworski, V. Kurauskas, and K. Rybarczyk, Recent progress in complex network analysis: properties of random intersection graphs, in Data science, learning by latent structures, and knowledge discovery, 79-88, Stud. Classification Data Anal. Knowledge Organ, Springer, Heidelberg, 2015.
  3. M. Coulson, R. E. Gaunt, and G. Reinert, Poisson approximation of subgraph counts in stochastic block models and a graphon model, ESAIM Probab. Stat. 20 (2016), 131-142. https://doi.org/10.1051/ps/2016006
  4. M. Deijfen and W. Kets, Random intersection graphs with tunable degree distribution and clustering, Probab. Engrg. Inform. Sci. 23 (2009), no. 4, 661-674. https://doi.org/10.1017/S0269964809990064
  5. S. Janson, T. Luczak, and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000. https://doi.org/10.1002/9781118032718
  6. T. Jeong, Y. M. Jung, and S. Yun, Iterative reweighted algorithm for non-convex Poissonian image restoration model, J. Korean Math. Soc. 55 (2018), no. 3, 719-734. https://doi.org/10.4134/JKMS.J170432
  7. M. Karonski, E. R. Scheinerman, and K. B. Singer-Cohen, On random intersection graphs: the subgraph problem, Combin. Probab. Comput. 8 (1999), no. 1-2, 131-159. https://doi.org/10.1017/S0963548398003459
  8. S. Nikoletseas, C. Raptopoulos, and P. Spirakis, Large independent sets in general random intersection graphs, Theoret. Comput. Sci. 406 (2008), no. 3, 215-224. https://doi.org/10.1016/j.tcs.2008.06.047
  9. K. Rybarczyk, The coupling method for inhomogeneous random intersection graphs, Electron. J. Combin. 24 (2017), no. 2, Paper 2.10, 45 pp. https://doi.org/10.37236/5446
  10. K. Rybarczyk and D. Stark, Poisson approximation of the number of cliques in random intersection graphs, J. Appl. Probab. 47 (2010), no. 3, 826-840. https://doi.org/10.1239/jap/1285335412
  11. K. Rybarczyk and D. Stark, Poisson approximation of counts of induced subgraphs in random intersection graphs, Discrete Math. 340 (2017), no. 9, 2183-2193. https://doi.org/10.1016/j.disc.2017.04.013
  12. Y. Shang, Degree distributions in general random intersection graphs, Electron. J. Combin. 17 (2010), Paper 23, 8pp. https://doi.org/10.37236/295
  13. Y. Shang, Isoperimetric numbers of randomly perturbed intersection graphs, Symmetry 11 (2019), article 452.