Topology-dependent density optima for efficient simultaneous network exploration
A random search process in a networked environment is governed by the time it takes to visit every node, termed the cover time. Often, a networked process does not proceed in isolation but competes with many instances of itself within the same environment. A key unanswered question is how to optimis...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
American Physical Society
2018
|