First encounters on combs.

Area of Science:

• Statistical Physics
• Network Science
• Stochastic Processes

Background:

• Random walks are fundamental models for diffusion and search processes on networks.
• Understanding encounter times is crucial for optimizing search strategies in various systems.
• Comb-like networks present unique topological challenges for diffusive processes.

Purpose of the Study:

• To investigate the mean first-encounter time (MFET) for two random walkers on a 2D comb network.
• To analyze how initial positions influence the scaling of MFET with network size.
• To compare search strategies by relating MFET to the mean first-passage time (MFPT) when one walker is fixed.

Main Methods:

• Numerical simulations to study MFET scaling for different initial walker positions.
• Analytical derivation of exact results for the MFPT when one walker remains stationary.
• Comparative analysis of MFET and MFPT to evaluate search strategy efficiency.

Main Results:

• Observed distinct scaling behaviors of MFET with network size, dependent on initial walker configurations.
• Determined exact MFPT for stationary and mobile walker scenarios.
• Identified that fixing one walker can accelerate search if initial positions are controlled.

Conclusions:

• The efficiency of search strategies on 2D comb networks depends critically on walker initial positions.
• A fixed-walker strategy can be advantageous for speeding up encounters under specific initial conditions.
• Random initial placements generally lead to slower search times when employing a fixed-walker approach.