arXiv (All)
open access
Normal approximation for subgraph counts in random intersection graphs: the case of edges
We investigate the subgraph count in the random intersection graph model $\mathcal G(n,m,p)$. Due to substantial edge dependencies, studying even such fundamental statistics is significantly more challenging than in the classical binomial model $\mathcal G(n,p)$. This article establish new normal ap
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Turán Number of Generalized Theta Graphs#1122862
- An Approximate-Master-Equation Formulation of the Watts Threshold Model on Hypergraphs#1342311
- Mathematical statistics#490504
- Mathematical Statistics#3438
- The maximum number of maximal dissociation sets in trees#625210
Record · ID 1412712
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive