Compound Poisson approximations of subgraph counts in random graphs

Authors
Stark, D
Citation
D. Stark, Compound Poisson approximations of subgraph counts in random graphs, RAND STR AL, 18(1), 2001, pp. 39-60
Citations number
11
Categorie Soggetti
Mathematics
Journal title
RANDOM STRUCTURES & ALGORITHMS
ISSN journal
10429832 → ACNP
Volume
18
Issue
1
Year of publication
2001
Pages
39 - 60
Database
ISI
SICI code
1042-9832(200101)18:1<39:CPAOSC>2.0.ZU;2-D
Abstract
We use Stein's method to bound compound Poisson approximations of the distr ibution of the number of subgraphs in random graphs which are isomorphic to some fixed graph. Our application of Stein's method is appropriate when th e fixed graph is a member of a certain subclass of the class of balanced gr aphs. (C) 2001 John Wiley & Sons, Inc.