arXiv (All)
open access
Tests of graph homogeneity, subgraph counts, and quasirandomness
Homogeneous random graphs, also known as Erd{\H os}-Rényi graphs, are a subset of the family of dense random graphs, specified by a graphon. We analyze several goodness-of-fit tests for these models that are based on subgraph counts. To obtain the limiting null distribution of the test statistics we
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
- Distribution-free testing of linear type#799309
- Distribution-free testing of linear type#797886
- Subdiffusion in the Anderson model on the random regular graph#1097563
- Random walk in a non-homogeneous random environment on some random trees and the non-negative integers#1105207
- DJPlus: Generating minimal test suites for strong coverage criteria in graph models#668101
Record · ID 822606
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