Poisson approximation for the number of induced copies of a fixed graph in a random regular graph

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Let Gn,dbe a random d-regular graph with n vertices. Given a fixed graph H. W denotes the number of induced copies of H in Gn,d. In this paper, we use Stein-Chen method and Local approach to show that W can approximate by the Poisson distribution and give the bound of this approximation.

References Powered by Scopus

Introduction to stein's method, an

55Citations
N/AReaders
Get full text

Induced subgraph in random regular graph

5Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Donganont, M. (2014). Poisson approximation for the number of induced copies of a fixed graph in a random regular graph. International Journal of Pure and Applied Mathematics, 95(1), 113–121. https://doi.org/10.12732/ijpam.v95i1.13

Readers' Seniority

Tooltip

Professor / Associate Prof. 1

33%

Lecturer / Post doc 1

33%

PhD / Post grad / Masters / Doc 1

33%

Readers' Discipline

Tooltip

Mathematics 2

67%

Agricultural and Biological Sciences 1

33%

Save time finding and organizing research with Mendeley

Sign up for free