On coalescence time in graphs: When is coalescing as fast as meeting?
<p>Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discretetime random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk. The coalescence time is defined a...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Society for Industrial and Applied Mathematics
2019
|