Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Optimal Foraging00:48

Optimal Foraging

How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
Randomized Experiments01:13

Randomized Experiments

The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
Random Sampling Method01:09

Random Sampling Method

Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and 0s. In...
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
Random Variables01:09

Random Variables

A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Toward a Database of Intracranial Electrophysiology during Natural Language Presentation.

Language, cognition and neuroscience·2022
Same author

Distraction "Hangover": Characterization of the Delayed Return to Baseline Driving Risk After Distracting Behaviors.

Human factors·2021
Same author

A Statistical Growth Property of Plant Root Architectures.

Plant phenomics (Washington, D.C.)·2020
Same author

Neuroscience for architecture: The evolving science of perceptual meaning.

Proceedings of the National Academy of Sciences of the United States of America·2019
Same author

Indistinguishable Synapses Lead to Sparse Networks.

Neural computation·2018
Same author

A clinic compatible, open source electrophysiology system.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2017
Same journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

Related Experiment Video

Updated: Jun 3, 2026

Barnes Maze Testing Strategies with Small and Large Rodent Models
12:59

Barnes Maze Testing Strategies with Small and Large Rodent Models

Published on: February 26, 2014

Optimal random search for a single hidden target.

Joseph Snider1

  • 1Institute for Neural Computation, University of California, San Diego, La Jolla, CA 92093, USA. j1snider@ucsd.edu

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|March 17, 2011
PubMed
Summary
This summary is machine-generated.

Finding a hidden target requires an optimal search distribution. The best strategy is proportional to the square root of the target distribution, especially when close proximity is needed for detection.

More Related Videos

A Dual Task Procedure Combined with Rapid Serial Visual Presentation to Test Attentional Blink for Nontargets
08:45

A Dual Task Procedure Combined with Rapid Serial Visual Presentation to Test Attentional Blink for Nontargets

Published on: December 5, 2014

Related Experiment Videos

Last Updated: Jun 3, 2026

Barnes Maze Testing Strategies with Small and Large Rodent Models
12:59

Barnes Maze Testing Strategies with Small and Large Rodent Models

Published on: February 26, 2014

A Dual Task Procedure Combined with Rapid Serial Visual Presentation to Test Attentional Blink for Nontargets
08:45

A Dual Task Procedure Combined with Rapid Serial Visual Presentation to Test Attentional Blink for Nontargets

Published on: December 5, 2014

Area of Science:

  • Probability theory
  • Search theory
  • Optimization algorithms

Background:

  • Optimal search strategies are crucial for efficiently locating targets in uncertain environments.
  • Understanding the relationship between target distribution and search patterns is key to minimizing search time.

Purpose of the Study:

  • To determine the optimal search distribution for locating a target based on its probability distribution.
  • To investigate how proximity requirements influence search strategy.
  • To analyze search strategies in both continuous spaces and network structures.

Main Methods:

  • Derivation of optimal search distribution as a function of target distribution.
  • Analysis of search strategies for Gaussian target distributions.
  • Evaluation of optimal search probabilities for network node sampling.

Main Results:

  • The optimal search distribution is proportional to the square root of the target distribution, irrespective of dimensionality, when close proximity is required.
  • For Gaussian target distributions, the optimal search distribution approximates a Gaussian with a standard deviation inversely related to the required proximity.
  • In network searches, optimal strategies involve sampling nodes with probability proportional to the square root of (out-degree + 1) or not sampling.

Conclusions:

  • The square root of the target distribution provides a robust optimal search strategy under proximity constraints.
  • The derived search distributions offer practical guidelines for efficient target localization in diverse scenarios.
  • Network search optimization can be achieved by carefully selecting node sampling probabilities based on network topology.