Multitarget search on complex networks: A logarithmic growth of global mean random cover time.
Sign Up to like & getrecommendations! Published in 2017 at "Chaos"
DOI: 10.1063/1.4990866
Abstract: 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… read more here.
Keywords: time; multitarget search; mean random; random ... See more keywords