Asymptotics of m-Cliques in a Sparse Inhomogeneous Random Graph

Xiaofeng Zhao and Gohar Ali

Journal of Mathematics, 2022, vol. 2022, 1-7

Abstract: One of the classical questions in random graph theory is to understand the asymptotics of subgraph counts. In inhomogeneous random graph, this question has not been well studied. In this study, we investigate the asymptotic distribution of m-cliques in a sparse inhomogeneous random graph. Under mild conditions, we prove that the number of m-cliques converges in law to the standard normal distribution.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/7411831.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/7411831.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:7411831

DOI: 10.1155/2022/7411831

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().