Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs

Lijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song 0002, Huacheng Yu. Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. In Nikhil Bansal, Emanuela Merelli, James Worrell 0001, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). Volume 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{0001KPS0Y21-0,
  title = {Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs},
  author = {Lijie Chen 0001 and Gillat Kol and Dmitry Paramonov and Raghuvansh R. Saxena and Zhao Song 0002 and Huacheng Yu},
  year = {2021},
  doi = {10.4230/LIPIcs.ICALP.2021.52},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.52},
  researchr = {https://researchr.org/publication/0001KPS0Y21-0},
  cites = {0},
  citedby = {0},
  booktitle = {48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  editor = {Nikhil Bansal and Emanuela Merelli and James Worrell 0001},
  volume = {198},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-195-5},
}