On the number of subgraphs of a specified form embedded in a random graph
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.
- Subgraph counts in random graphs using incomplete U-statistics methods
- scientific article; zbMATH DE number 3943865
- A functional limit theorem for random graphs with applications to subgraph count statistics
- On the number of induced subgraphs of a random graph
- When are small subgraphs of a random graph normally distributed?
This page was built for publication: On the number of subgraphs of a specified form embedded in a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1397228)
