Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs.

zbMATH Open1082.60510MaRDI QIDQ3376208FDOQ3376208

Authors: Raúl Fierro, Gladys Figueroa 

Publication date: 23 March 2006

Recommendations

• A functional limit theorem for random graphs with applications to subgraph count statistics
• Asymptotic distributions in random graphs with applications to social networks
• Susceptibility in subcritical random graphs
• scientific article; zbMATH DE number 3943865
• Subgraph counts in random graphs using incomplete U-statistics methods

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17)

Cited In (2)

• A functional limit theorem for random graphs with applications to subgraph count statistics
• Asymptotic properties of stochastic timed event graphs

This page was built for publication: Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376208)