Simulating Random Walks on Graphs in the Streaming Model

@inproceedings{Jin2019SimulatingRW,
  title={Simulating Random Walks on Graphs in the Streaming Model},
  author={Ce Jin},
  booktitle={ITCS},
  year={2019}
}
  • Ce Jin
  • Published in ITCS 2019
  • Computer Science, Mathematics
  • We study the problem of approximately simulating a t-step random walk on a graph where the input edges come from a single-pass stream. The straightforward algorithm using reservoir sampling needs O(nt) words of memory. We show that this space complexity is near-optimal for directed graphs. For undirected graphs, we prove an Omega(n sqrt{t})-bit space lower bound, and give a near-optimal algorithm using O(n sqrt{t}) words of space with 2^{-Omega(sqrt{t})} simulation error (defined as the l_1… CONTINUE READING
    4 Citations
    Walking randomly, massively, and efficiently
    • 8
    • PDF
    N ov 2 01 9 Walking Randomly , Massively , and Efficiently
    Vertex Ordering Problems in Directed Graph Streams
    • 3
    • PDF
    Massive Graph Analysis in the Data Stream Model

    References

    SHOWING 1-10 OF 19 REFERENCES
    Estimating PageRank on graph streams
    • 146
    • PDF
    Better bounds for matchings in the streaming model
    • 95
    • PDF
    Analyzing graph structure via linear measurements
    • 209
    • PDF
    Undirected connectivity in log-space
    • 467
    • PDF
    Finding sparse cuts locally using evolving sets
    • 139
    • PDF
    Using PageRank to Locally Partition a Graph
    • 57
    • PDF
    Single Pass Spectral Sparsification in Dynamic Streams
    • 132
    • PDF
    Spectral Sparsification in the Semi-streaming Setting
    • 131
    • PDF
    Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
    • 96
    • PDF