ScholarLens Back to search
2000•Random Structures and AlgorithmsRequires access

Compound Poisson approximations of subgraph counts in random graphs

Dudley Stark

Open publisher page 12 citations

Abstract

We use Stein's method to bound compound Poisson approximations of the distribution of the number of subgraphs in random graphs which are isomorphic to some fixed graph. Our application of Stein's method is appropriate when the fixed graph is a member of a certain subclass of the class of balanced graphs. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 39–60, 2001

About this research paper

What this paper is about

We use Stein's method to bound compound Poisson approximations of the distribution of the number of subgraphs in random graphs which are isomorphic to some fixed graph. Our application of Stein's method is appropriate when the fixed graph is a member of a certain subclass of the class of balanced graphs. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 39–60, 2001

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We use Stein's method to bound compound Poisson approximations of the distribution of the number of subgraphs in random graphs which are isomorphic to some fixed graph. Our application of Stein's method is appropriate when the fixed graph is a member of a certain subclass of the class of balanced graphs. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 39–60, 2001

Key concepts: Mathematics, Random graph, Combinatorics, Poisson distribution, struct, Discrete mathematics, Induced subgraph isomorphism problem, Random regular graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Compound Poisson approximations of subgraph counts in random graphs — Research Paper | ScholarLens