Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
11 Downloads (Pure)

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=⌊βnα⌋ (α,β>0), tend to infinity.
Original languageEnglish
Pages (from-to)1199-1210
JournalBulletin of the Korean Mathematical Society
Volume56
Issue number5
Early online date30 Sep 2019
DOIs
Publication statusPublished - Sep 2019

Fingerprint Dive into the research topics of 'Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model'. Together they form a unique fingerprint.

Cite this