# Collaboration of Random Walks on Graphs

## TL;DR

This paper investigates how multiple independent random walks on a graph collaboratively cover vertices, demonstrating that combined coverage exceeds that of a single walk with equivalent total lifespan, and explores related graph exploration methods.

## Contribution

It establishes a lower bound on the expected coverage of multiple random walks compared to a single walk with combined lifespan, advancing understanding of graph exploration strategies.

## Key findings

- Expected coverage of k walks exceeds single walk with summed lifespan
- Analysis of various graph exploration schemes
- Discussion of open questions in graph coverage

## Abstract

Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the efficiency of covering the graph. To this end, we show that the expected size of the union of ranges of $k$ independent random walks with lifespans $t_1,t_2,\ldots,t_k$, respectively, is greater than or equal to that of a single random walk with the lifespan equal to $t_1+t_2+\cdots+t_k$. We analyze other related graph exploration schemes and end with many open questions.