Random Target Searches by Multiple Particles

Explore the fascinating world of random target searches in this 36-minute lecture by Yong Woon Kim from PCS Institute for Basic Science. Delve into the first-passage problem, examining how long it takes to find a target through random processes. Discover the relevance of this concept across various fields, including physics, animal foraging, and stock market dynamics. Learn about recent advancements in first-passage problems involving multiple Brownian particles, and understand the complexities that arise when considering the smallest value among first-passage times. Investigate the reformulation of first-passage dynamics with competing search agents and explore the optimal initial searcher distribution for minimizing first-passage time. Gain insights into the effects of interactions among search agents and their impact on the dynamical problem.

Introduction
Target Search Problem
Target Search Definition
Problem
Scaling Argument
Universal Behavior
Optimal Initial Distribution
Collective Searching Efficiency
Alternative Approach
Interaction between Searchers
dynamical problem
final answer
summary
thank you
user question