Statistics of Similarity Graphs in Node-Arrival Streams

Kaiwen Liu; Qin Zhang

Home/Archive/arXiv

arXiv · 2609.04505

Statistics of Similarity Graphs in Node-Arrival Streams

Kaiwen Liu·Qin Zhang

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study several statistical problems on similarity graphs in the node-arrival streaming model, including degree moments, diversity index, degree-moment sampling, and diversity sampling. We develop constant-pass, sublinear-space streaming algorithms for these problems and establish space lower bounds that nearly match the upper bounds in their dependence on the stream length.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Kaiwen Liu, Qin Zhang. 2026-09-03. Statistics of Similarity Graphs in Node-Arrival Streams. https://arxiv.org/abs/2609.04505

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DS subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

DS-Lighting: Making Agent Harnesses Explicit for Data-Science Automation

Large Language Model (LLM) agents have shown promise for automating data-science workflows, yet their end-to-end performance depends critically on the agent harness that represents tasks, manages execution state, constrains output artifacts, and provides evaluation feedback. Existing data-science agents often leave this harness implicit, making results difficult to reproduce, compare, and attribute across heterogeneous tasks. We introduce DS-Lighting, a unified harness toolkit that makes harness design explicit for data-science automation. DS-Lighting decomposes the harness into four reusable layers: data, workflow, execution, and evaluation, and represents diverse agents as executable operator programs that support both predefined pipelines and adaptive search. We further integrate multiple open-source data-science benchmarks into an MLE-Bench-style task format, enabling controlled comparison under a shared task interface, sandboxed runtime, and metric protocol. Experiments across agents, harnesses, models, and ablations show that explicit harness design improves reproducibility, comparability, and reliability, while reducing avoidable system-level failures in end-to-end data-science workflows. Our code is available at https://github.com/usail-hkust/dslighting

cs.AI↗

arXiv2026

An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum

We give a randomised algorithm for Equal Subset Sum that, on $n$ arbitrary integers of at most $m\le2^n$ bits, runs in time $O\big((5/3)^n\mathrm{poly}(n)+n^2m\big)$, never outputs a non-solution, and outputs a solution with probability $1-2^{-Ω(n)}$ whenever one exists.

cs.DS↗

arXiv2026

Disproving the Greedy Superstring Conjecture

The shortest common superstring problem is to find the shortest string that contains every string in a given set as a substring. It is conjectured that the greedy algorithm that repeatedly selects a pair of strings with maximum overlap and merges them is a $2$-approximation algorithm, and this conjecture had remained open for nearly four decades. In this paper, we disprove this conjecture and show that the approximation ratio of this algorithm is at least $9/4$.

cs.DS↗