Variance of the subgraph count for sparse Erdős-Rényi graphs

DOI10.1016/J.DAM.2009.11.012zbMATH Open1225.05217OpenAlexW2147959155MaRDI QIDQ968190FDOQ968190

Authors: Robert B. Ellis, James P. Ferry 

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.012

Recommendations

• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Subgraph counts in random graphs using incomplete U-statistics methods
• Largest sparse subgraphs of random graphs
• Modular statistics for subgraph counts in sparse random graphs
• When are small subgraphs of a random graph normally distributed?

zbMATH Keywords

variancegraph isomorphismsmall subgraphsubgraph plotErdős-Rényi graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph polynomials (05C31) Combinatorial probability (60C05) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold functions for small subgraphs
• Paths in graphs
• Some remarks on the theory of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mathematical Methods in Counterterrorism

This page was built for publication: Variance of the subgraph count for sparse Erdős-Rényi graphs

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