article · Greater South Information System · 2014

POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH

Mana Donganont

Cited by 0Open access

Abstract

Let G n,d be a random d-regular graph with n vertices.Given a fixed graph H. W denotes the number of induced copies of H in G n,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.

Cite this paper

APA 7

Donganont, M. (2014). POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH. Greater South Information System. https://doi.org/10.60692/yc7cb-etj61

MLA 9

Donganont, Mana. “POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH.” Greater South Information System, 2014, https://doi.org/10.60692/yc7cb-etj61.

Chicago

Donganont, Mana. 2014. “POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH.” Greater South Information System. https://doi.org/10.60692/yc7cb-etj61.

Harvard

Donganont, M. (2014) ‘POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH’, Greater South Information System. Available at: https://doi.org/10.60692/yc7cb-etj61.

BibTeX

@article{donganont2014poisson,
  title = {{POISSON APPROXIMATION FOR THE NUMBER OF INDUCED COPIES OF A FIXED GRAPH IN A RANDOM REGULAR GRAPH}},
  author = {Donganont, Mana},
  journal = {Greater South Information System},
  year = {2014},
  doi = {10.60692/yc7cb-etj61}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.