@inproceedings{eeeb9ed3f5ba456fbf754b738cebd1d7,
title = "Sampling an Edge in Sublinear Time Exactly and Optimally",
abstract = "Sampling edges from a graph in sublinear time is a fundamental problem and a powerful subroutine for designing sublinear-time algorithms. Suppose we have access to the vertices of the graph and know a constant-factor approximation to the number of edges. An algorithm for pointwise ε-approximate edge sampling with complexity O(n/√εm) has been given by Eden and Rosenbaum [SOSA 2018]. This has been later improved by T{\v e}tek and Thorup [STOC 2022] to O(nlog(ε−1)/√m). At the same time, Ω(n/√m) time is necessary. We close the problem, by giving an algorithm with complexity O(n/√m) for the task of sampling an edge exactly uniformly.",
author = "Talya Eden and Shyam Narayanan and Jakub T{\v e}tek",
note = "Publisher Copyright: Copyright {\textcopyright} 2023 by SIAM.; 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023 ; Conference date: 23-01-2023 Through 25-01-2023",
year = "2023",
doi = "https://doi.org/10.1137/1.9781611977585.ch23",
language = "الإنجليزيّة",
series = "Proceedings - 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023",
publisher = "Society for Industrial and Applied Mathematics Publications",
pages = "253--260",
editor = "Telikepalli Kavitha and Kurt Mehlhorn",
booktitle = "Proceedings - 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023",
address = "الولايات المتّحدة",
}