On the number of subgraphs of a specified form embedded in a random graph (Q1397228): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1024173204072 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W5664448 / rank | |||
Normal rank |
Latest revision as of 09:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of subgraphs of a specified form embedded in a random graph |
scientific article |
Statements
On the number of subgraphs of a specified form embedded in a random graph (English)
0 references
27 July 2003
0 references
This paper deals with the number of subgraphs of a specified form and embedded in a random graph. A graph \(G_n(x)\), \(x> 0\), is formed by joining each pair of points in \(\{U_i\): \(U_i\) represents i.i.d. random variables in \(\mathbb{R}^d\), \(1\leq i\leq n\}\) which are separated by a distance \(\leq x\). Let \(A\) be a collection of graphs on \(m\) \((\leq n)\) points with a specified structure, and let \(C_n(x, A)\) represent the number of subgraphs embedded in \(G_n(x)\) and contained in \(A\). For \(C_n(x,A)\), using U-statistics theory, it is shown that SLLN, CLT, and LIL follow easily. For some special cases the scaling constants in CLT (central limit theorem) are obtained. Some simulations and illustrative examples are also presented.
0 references
random graphs and subgraphs
0 references
uniform strong law of large numbers
0 references
central limit theorem
0 references
law of the iterated logarithm
0 references