On the number of subgraphs of a specified form embedded in a random graph
From MaRDI portal
Publication:1397228
DOI10.1023/A:1024173204072zbMath1029.05139MaRDI QIDQ1397228
Ralph P. Russo, Christopher A. Najim
Publication date: 27 July 2003
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024173204072
law of the iterated logarithm; central limit theorem; uniform strong law of large numbers; random graphs and subgraphs
60D05: Geometric probability and stochastic geometry
60F05: Central limit and other weak theorems
05C80: Random graphs (graph-theoretic aspects)
60F15: Strong limit theorems
Related Items
Statistical properties of a generalized threshold network model, On the number of weakly connected subdigraphs in random \(k\)NN digraphs