Related Experiment Video
Updated: Aug 29, 2026

Barnes Maze Testing Strategies with Small and Large Rodent Models
Published on: February 26, 2014
Dynamical robustness of Lévy search strategies
E P Raposo1, Sergey V Buldyrev, M G E da Luz
1Laboratório de Física Teórica e Computacional, Departamento de Física, Universidade Federal de Pernambuco, 50670-901, Recife-PE, Brazil.
Abstract:
We study the role of dynamical constraints in the general problem of finding the best statistical strategy for random searching when the targets can be detected only in the limited vicinity of the searcher. We find that the optimal search strategy depends strongly on the delay time tau during which a previously visited site becomes unavailable. We also find that the optimal search strategy is always described for large step lengths l by a power-law distribution P(l) approximately l(-mu), with 1
Related Concept Videos
Stability of Equilibrium Configuration: Problem Solving
Problem-solving in the context of the stability of equilibrium configuration...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Lagrange Multipliers: Problem Solving
Randomized Experiments
Simple randomization
Simple...
Stability of Equilibrium Configuration
A stable equilibrium occurs when a system tends to return to its original position when given a small displacement, and the potential energy is at its minimum. An example of a stable equilibrium is when a cantilever beam is fixed at one end and a weight is attached to the other end. If the weight...
Stability of structures
