3 papers
cs.DS2026
An Efficient Streaming Algorithm for Approximating Graphlet Distributions
Marco Bressan, T-H. Hubert Chan, Qipeng Kuang +1
In recent years, the problem of computing the frequencies of the induced -vertex subgraphs of a graph, or \emph{-graphlets}, has become central. One approach for this problem…
math.FA2026
Universal Closest Refinement on Measurable Bipartite Relations
T-H. Hubert Chan
We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finit…
cs.CR2025
Fully-Fluctuating Participation in Sleepy Consensus
Yuval Efron, Joachim Neu, Toniann Pitassi
Proof-of-work allows Bitcoin to boast security amidst arbitrary fluctuations in participation of miners throughout time, so long as, at any point in time, a majority of hash power…