Related Experiment Video
Updated: Mar 16, 2026

Barnes Maze Testing Strategies with Small and Large Rodent Models
Published on: February 26, 2014
Optimality of Spatially Inhomogeneous Search Strategies
Karsten Schwarz1, Yannick Schröder1, Bin Qu2
1Theoretical Physics, Saarland University, 66123 Saarbrücken, Germany.
Abstract:
We consider random search processes alternating stochastically between diffusion and ballistic motion, in which the distribution function of ballistic motion directions varies from point to point in space. The specific space dependence of the directional distribution together with the switching rates between the two modes of motion establishes a spatially inhomogeneous search strategy. We show that the mean first passage times for several standard search problems-narrow escape, reaction partner finding, reaction escape-can be minimized with a directional distribution that is reminiscent of the spatial organization of the cytoskeleton filaments of cells with a centrosome: radial ballistic transport from the center to the periphery and back, and ballistic transport in random directions within a concentric shell of thickness Δ_{opt} along the domain boundary. The results suggest that living cells realize efficient search strategies for various intracellular transport problems economically through a spatial cytoskeleton organization that involves radial microtubules in the central region and only a narrow actin cortex rather than a cell body filled with randomly oriented actin filaments.
More Related Videos
Related Concept Videos
Optimal Foraging
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Problem-Solving
Optimization Problems

