arXiv:2610.23364 · v2

Power of Conditional Sampling on Hypergraphs

首次提交 2026-10-16 20:14

版本更新 2026-10-27 21:52

雷达观测 2026-10-29 00:34

摘要

Let $G=(V,E)$ be a $d$-uniform hypergraph with $|V|=n$ and $|E|=m$. Estimating $m$ from uniformly random hyperedge samples requires $Θ(\sqrt{m})$ samples by a birthday-paradox argument. We investigate the power of conditional sampling through a hierarchy of oracles: for an integer $1\le s\le d$, given pairwise disjoint subsets $X_1,\ldots,X_s\subseteq V$, the $s$-colorful oracle returns a hyperedge chosen uniformly at random from all hyperedges contained in $X_1\cup\cdots\cup X_s$ that intersect every $X_i$, provided one exists. For $s=1$, this samples a uniformly random hyperedge induced by $X_1$. For every $1\le s\le d$, we give a randomized algorithm that outputs $\widehat{m}\in[(1-\varepsilon)m,(1+\varepsilon)m]$ with probability at least $2/3$ using $O_{s,d}(\operatorname{poly}(1/\varepsilon,\log n))$ conditional samples, where the exponent of $\log n$ is an absolute constant independent of both $s$ and $d$. Conditional sampling thus yields an exponential separation over uniform hyperedge sampling. We also study the decision version, in which the oracle only reports whether a qualifying hyperedge exists. For every $1\le s<d$, we prove that any algorithm using the $s$-colorful decision oracle requires $\widetildeΩ_{s,d}(n^{\frac{d-s}{d-s+1}})$ queries. Hence, for $s<d$, access to uniformly random witness hyperedges (random certificates) is exponentially more powerful than existence queries. For $s=d$, decision queries alone achieve $\operatorname{poly}(1/\varepsilon,\log n)$ query complexity, but the exponent of $\log n$ is known to be $Θ(d)$. The colorful hierarchy thus exhibits a phase transition at $s=d$: for $s<d$, random certificates are essential for polylogarithmic-query estimation, whereas at $s=d$ decision queries suffice, yet random certificates still provably reduce the exponent of $\log n$ from $Θ(d)$ to an absolute constant.