On the number of subgraphs of a specified form embedded in a random graph
From MaRDI portal
Publication:1397228
DOI10.1023/A:1024173204072zbMath1029.05139OpenAlexW5664448MaRDI 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 logarithmcentral limit theoremuniform strong law of large numbersrandom graphs and subgraphs
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15)
Related Items (2)
On the number of weakly connected subdigraphs in random \(k\)NN digraphs ⋮ Statistical properties of a generalized threshold network model
This page was built for publication: On the number of subgraphs of a specified form embedded in a random graph
