Unexpected advantages of exploitation for target searches in complex networks

Abstract

Exploitation universally emerges in various decision-making contexts, e.g., animals foraging, web surfing, the evolution of scientists' research topics, and our daily lives. Despite its ubiquity, exploitation, which refers to the behavior of revisiting previous experiences, has often been considered to delay the search process of finding a target. In this paper, we investigate how exploitation affects search performance by applying a non-Markovian random walk model, where a walker randomly revisits a previously visited node using long-term memory. We analytically study two broad forms of network structures, namely (i) clique-like networks and (ii) lollipop-like networks, and find that exploitation can significantly improve search performance in lollipop-like networks whereas it hinders target search in clique-like networks. Moreover, we numerically verify that exploitation can reduce the time needed to fully explore the underlying networks by using $550$ diverse real-world networks. Based on the analytic result, we define the lollipop-likeness of a network and observe a positive relationship between the advantage of exploitation and lollipop-likeness.

arXiv comment12 pages, 7 figures

References in corpus (30)

• Temporal Networks
• Modeling the scaling properties of human mobility
• Diffusion with Stochastic Resetting
• Random walks and diffusion on networks
• First-passage times in complex scale-invariant media
• Elephants can always remember: Exact long-range memory effects in a non-Markovian random walk
• Global mean first-passage times of random walks on complex networks
• Random walks with preferential relocations to places visited in the past and their application to biology
• Quantifying patterns of research interest evolution
• Network dynamics of innovation processes
• Exploring complex networks by walking on them
• Stacking Models for Nearly Optimal Link Prediction in Complex Networks
• Mean first-passage times of non-Markovian random walkers in confinement
• Increasing trend of scientists to switch between topics
• Search with home returns provides advantage under high uncertainty
• Non-Markovian polymer reaction kinetics
• Characteristic times of biased random walks on complex networks
• Random walks on networks with stochastic resetting
• Localization transition induced by learning in random searches
• Understanding the onset of hot streaks across artistic, cultural, and scientific careers
• Cover time for random walks on arbitrary complex networks
• Knowledge Acquisition: A Complex Networks Approach
• Trapping in complex networks
• Asymptotic analysis of first passage time in complex networks
• Diffusive transport on networks with stochastic resetting to multiple nodes
• Mean first-passage time for random walks in general graphs with a deep trap
• Random walks on complex networks with multiple resetting nodes: a renewal approach
• The Dynamics of Knowledge Acquisition via Self-Learning in Complex Networks
• Dynamically accelerated cover times
• Random Walks on Complex Networks

Cited by in corpus (1)

• Stochastic Resetting Mitigates Latent Gradient Bias of SGD from Label Noise