Poisson convergence and semi-induced properties of random graphs
Authors:
- 1 March 1987
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 101 (2) , 291-300
Abstract
Barbour [l] invented an ingenious method of establishing the asymptotic distribution of the number X of specified subgraphs of a random graph. The novelty of his method relies on using the first two moments of X only, despite the traditional method of moments that involves all moments of X (compare [8, 10, 11, 14]). He also adjusted that new method for counting isolated trees of a given size in a random graph. (For further applications of Barbour's method see [4] and [10].) The main goal of this paper is to show how this method can be extended to a general setting that enables us to derive asymptotic distributions of subsets of vertices of a random graph with various properties.Keywords
This publication has 8 references indexed in Scilit:
- On the number of vertices of given degree in a random graphJournal of Graph Theory, 1984
- Poisson approximation for some statistics based on exchangeable trialsAdvances in Applied Probability, 1983
- Poisson convergence and random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1982
- Vertices of given degree in a random graphJournal of Graph Theory, 1982
- Percolation Theory for Mathematicians1982
- Limit theorems for complete subgraphs of random graphsPeriodica Mathematica Hungarica, 1979
- Probability Theory1978
- On Extreme Metric Characteristics of a Random Graph. II. Limit DistributionsTheory of Probability & Its Applications, 1975