Главная
Study mode:
on
1
Introduction
2
Target Search Problem
3
Target Search Definition
4
Problem
5
Scaling Argument
6
Universal Behavior
7
Optimal Initial Distribution
8
Collective Searching Efficiency
9
Alternative Approach
10
Interaction between Searchers
11
dynamical problem
12
final answer
13
summary
14
thank you
15
user question
Description:
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.

Random Target Searches by Multiple Particles

PCS Institute for Basic Science
Add to list
0:00 / 0:00