Metraipolis › archive › dc_07f847f5ff93

Optimal Passes and Perfect Sampling for Similarity Graph Statistics — arXiv:2609.35798

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.35798
License (as archived)
CC0-1.0
Archived
2026-10-07T19:18:57.301Z
SHA-256 of the archived text
30a578b138d288ebceb7ec8edaf46574c2501a7ccc64fa1fb8ea5d31af5691b4
Stable URL of this page
https://metraipolis.com/documento/dc_07f847f5ff93

How to cite

Optimal Passes and Perfect Sampling for Similarity Graph Statistics — arXiv:2609.35798 — arXiv (en), https://arxiv.org/abs/2609.35798 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_07f847f5ff93 (Metraipolis archive dc_07f847f5ff93, sha256 30a578b138d288ebceb7ec8edaf46574c2501a7ccc64fa1fb8ea5d31af5691b4)
BibTeX
@misc{dc07f847f5ff93,
  title = {Optimal Passes and Perfect Sampling for Similarity Graph Statistics — arXiv:2609.35798},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.35798},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_07f847f5ff93; sha256 30a578b138d288ebceb7ec8edaf46574c2501a7ccc64fa1fb8ea5d31af5691b4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35798. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study statistical estimation on implicit weighted similarity graphs presented as node-arrival streams. Previous work~\cite{LZ26b} obtained constant-pass, sublinear-space algorithms for several basic statistics of such graphs, including the diversity index $\mathsf{DI}=\sum_i d_i^{-1}$ and the degree moments $M_p=\sum_i d_i^p$ for $p>0$, together with their associated sampling problems $L_{\mathsf{DI}}$ and $L_{M_p}$. We settle three questions left unresolved by the previous work. First, we show that any two-pass streaming algorithm that $1.1$-approximates $\mathsf{DI}$ requires $\Omega(n)$ bits of space; combined with the three-pass $\tilde{O}(\sqrt n)$-space algorithm of~\cite{LZ26b}, this establishes a sharp transition between two and three passes for $\mathsf{DI}$. Second and third, for every fixed $c>0$ we give a three-pass $n^{-c}$-perfect $L_{\mathsf{DI}}$-sampler using $O_c(\sqrt n\log n)$ words and a two-pass $n^{-c}$-perfect $L_{M_p}$-sampler using $O_{p,c}(n^{1-1/(p+1)}\log n)$ words. Matching lower bounds up to polylogarithmic factors show that both the number of passes and the polynomial dependence on $n$ are optimal.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.35798 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:45:07.071Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).