Multitarget search on complex networks: A logarithmic growth of global mean random cover time

We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specificall...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2017-09
Main Authors: Weng, Tongfeng, Zhang, Jie, Small, Michael, Yang, Ji, Farshid Hassani Bijarbooneh, Pan, Hui
Format: Article
Language:English
Subjects:
Networks
Random walk
Random walk theory
Searching
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target number for a broad range of random search processes, including generic random walks, biased random walks, and maximal entropy random walks. We show that the logarithmic growth pattern is a universal feature of multi-target search on networks by using the annealed network approach and the Sherman-Morrison formula. Moreover, we find that for biased random walks, the global mean random cover time can be minimized, and that the corresponding optimal parameter also minimizes the global mean first passage time, pointing towards its robustness. Our findings further confirm that the logarithmic growth pattern is a universal law governing multitarget search in confined media.
ISSN:2331-8422
DOI:10.48550/arxiv.1701.03259