A central limit theorem for decomposable random variables with applications to random graphs
type: Item
instance of: scholarly article
title: A central limit theorem for decomposable random variables with applications to random graphs
zbMATH Open document ID: 0689.05042
DOI: 10.1016/0095-8956(89)90014-2
author: Michal Karonski
author: Andrzej Ruciński
author: A. D. Barbour
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: Stein's method of proving the central limit theorem for dependent random variables is applied in the context of random graph theory. Results are given for various subgraph counts and degree counts in Bernoulli graphs.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60F05
zbMATH DE Number: 4128850
zbMATH Keywords: normal approximation
zbMATH Keywords: rate of convergence
zbMATH Keywords: decomposable random variables
zbMATH Keywords: subgraph counts
zbMATH Keywords: degree counts
zbMATH Keywords: Bernoulli graphs
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90014-2
OpenAlex ID: W1968989096
cites work: Poisson convergence and random graphs
cites work: Multiple comparisons and sums of dissociated random variables
cites work: Random association of symmetric arrays
cites work: On Bounds to the Rate of Convergence in the Central Limit Theorem
cites work: Q3794956
cites work: Poisson approximation for dependent trials
cites work: Two central limit problems for dependent random variables
cites work: Q3286850
cites work: A Class of Statistics with Asymptotically Normal Distribution
cites work: A Non-Parametric Test of Independence
cites work: Poisson convergence and Poisson processes with applications to random graphs
cites work: Q3222887
cites work: Poisson convergence and semi-induced properties of random graphs
cites work: Q3975007
cites work: On the number of induced subgraphs of a random graph
cites work: Dissociated random variables
cites work: Subgraph counts in random graphs using incomplete U-statistics methods
cites work: Approximation Theorems of Mathematical Statistics
cites work: Q4404195
Recommended article: A central limit theorem with applications to random hypergraphs
Recommended article: Central limit type theorems in the generalized random graphs with random vertex weights
Recommended article: A central limit theorem of random biased connected graphs
Recommended article: Central limit theorem for the largest component of random intersection graph
Recommended article: Orthogonal decompositions and functional limit theorems for random graph statistics
Recommended article: Central Limit Theorems and Asymptotic Spectral Analysis on Large Graphs
Recommended article: On Riesz and Wishart distributions associated with decomposable undirected graphs
Recommended article: Central limit theorems for large graphs: Method of quantum decomposition
description: scientific article; zbMATH DE number 4128850