Unexpected advantages of exploitation for target searches in complex networks

DOI10.1063/5.0089155MaRDI QIDQ6567595FDOQ6567595

Authors: Youngkyoung Bae, Gangmin Son, Hawoong Jeong 

Publication date: 5 July 2024

Published in: Chaos (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05Cxx) Stochastic processes (60Gxx) Combinatorial probability (60Cxx)

Cites Work

• A guide to first-passage processes
• Maximum hitting time for random walks on graphs
• Title not available (Why is that?)
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• The cover time of sparse random graphs
• The cover time of the preferential attachment graph
• Knowledge acquisition: a complex networks approach
• Random walks and diffusion on networks
• The problem of the random walk.
• Random walks on complex networks with multiple resetting nodes: a renewal approach

This page was built for publication: Unexpected advantages of exploitation for target searches in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567595)