arXiv (All)
open access
The Matching Number Characterizes the Query Complexity of Edge Counting and Degree Moment Estimation
Consider an unknown graph $G = (V,E)$ with vertex degrees $d_v$, accessed only by sampling uniformly random edges and querying the degrees of their endpoints. We study the query complexity of estimating the number of edges $m$ and the degree moments $M_s = \sum_{v \in V} (d_v)^s$ for fixed integers
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
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378247
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378240
- Quasi-uniform designs from random candidates: optimal candidate complexity and farthest-point sampling#973598
- Cycle-factors of regular graphs via entropy#1141430
- Complexity and information#762106
Record · ID 1325500
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