Better Bounds for Coalescing-Branching Random Walks
ACM TRANSACTIONS ON PARALLEL COMPUTING, 2018.
Coalescing-branching random walks, or cobra walks for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a k-cobra walk, at each timestep, a subset of the vertices are active; each active vertex chooses k random neighbors (sampled indepe...More
Full Text (Upload PDF)
PPT (Upload PPT)