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

MaRDI QIDQ3376208zbMATH OpenFDO

Authors Raúl Fierro, Gladys Figueroa

Publication date 23 March 2006

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)