Better bounds for coalescing-branching random walks

SPAA, 2016.

Cited by: 11|Bibtex|Views23|DOI:https://doi.org/10.1145/2935764.2935791
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|arxiv.org

Abstract:

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 time step a subset of the vertices are active; each active vertex chooses k random neighbors (sampled indepe...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments