Statistics of Similarity Graphs in Node-Arrival Streams

2026-09-03

AI Summary

本文研究了节点到达流模型中相似性图的统计问题，如度矩、多样性指数等，并开发了常数遍历、亚线性空间的流算法来解决这些问题。

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.

Problem

• similarity graphs
• node-arrival streams
• degree moments
• diversity index
• sampling

Innovation

• node-arrival streaming model
• sublinear-space algorithms
• space lower bounds