Modular statistics for subgraph counts in sparse random graphs

Bobby DeMarco, Jeff Kahn, Amanda Redlich

Research output: Contribution to journalArticlepeer-review

Abstract

Answering a question of Kolaitis and Kopparty, we show that, for given integer q > 1 and pairwise nonisomorphic connected graphs G1,…,Gk, if p = p(n) is such that Pr(Gn,p ⊇ Gi) → 1 ∀i, then, with ξi the number of copies of Gi in Gn,p, (ξ1,…,ξk) is asymptotically uniformly distributed on Zkq

Original languageEnglish (US)
JournalElectronic Journal of Combinatorics
Volume22
Issue number1
DOIs
StatePublished - 2015

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Modular statistics for subgraph counts in sparse random graphs'. Together they form a unique fingerprint.

Cite this