2 papers
cs.DS2021
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
Lijie Chen, Gillat Kol, Dmitry Paramonov +3
For a directed graph with vertices and a start vertex , we wish to (approximately) sample an -step random walk over starting from with…
cs.DS2019
Preconditioning for the Geometric Transportation Problem
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
In the geometric transportation problem, we are given a collection of points in -dimensional Euclidean space, and each point is given a supply of units of mass, where…