On the number of subgraphs of a specified form embedded in a random graph (Q1397228)

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.