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

Genetic Drift03:33

Genetic Drift

42.3K
Natural selection—probably the most well-known evolutionary mechanism—increases the prevalence of traits that enhance survival and reproduction. However, evolution does not merely propagate favorable traits, nor does it always benefit populations.
42.3K
Mutation, Gene Flow, and Genetic Drift01:09

Mutation, Gene Flow, and Genetic Drift

61.1K
In a population that is not at Hardy-Weinberg equilibrium, the frequency of alleles changes over time. Therefore, any deviations from the five conditions of Hardy-Weinberg equilibrium can alter the genetic variation of a given population. Conditions that change the genetic variability of a population include mutations, natural selection, non-random mating, gene flow, and genetic drift (small population size).
61.1K
Limits to Natural Selection01:38

Limits to Natural Selection

33.6K
Organisms that are well-adapted to their environment are more likely to survive and reproduce. However, natural selection does not lead to perfectly adapted organisms. Several factors constrain natural selection.
33.6K
Hardy-Weinberg Principle01:49

Hardy-Weinberg Principle

75.3K
Diploid organisms have two alleles of each gene, one from each parent, in their somatic cells. Therefore, each individual contributes two alleles to the gene pool of the population. The gene pool of a population is the sum of every allele of all genes within that population and has some degree of variation. Genetic variation is typically expressed as a relative frequency, which is the percentage of the total population that has a given allele, genotype or phenotype.
75.3K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

188
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
188
Frequency-dependent Selection01:21

Frequency-dependent Selection

22.8K
When the fitness of a trait is influenced by how common it is (i.e., its frequency) relative to different traits within a population, this is referred to as frequency-dependent selection. Frequency-dependent selection may occur between species or within a single species. This type of selection can either be positive—with more common phenotypes having higher fitness—or negative, with rarer phenotypes conferring increased fitness.
22.8K

You might also read

Related Articles

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

Sort by
Same author

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.

Evolutionary computation·2023
Same author

The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis.

Evolutionary computation·2021
Same author

Posterior Inferior Cerebellar Infarct in a Younger Adult Male with Vertigo and Ataxia.

Spartan medical research journal·2021
Same author

The Unrestricted Black-Box Complexity of Jump Functions.

Evolutionary computation·2016
Same author

Unbiased Black-Box Complexities of Jump Functions.

Evolutionary computation·2015
Same author

Mutation rate matters even when optimizing monotonic functions.

Evolutionary computation·2011

Related Experiment Video

Updated: Nov 30, 2025

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli
15:00

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli

Published on: August 18, 2023

4.0K

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.

Benjamin Doerr1

  • 1Laboratoire d'Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris, Palaiseau, 92128, France doerr@lix.polytechnique.fr.

Evolutionary Computation
|November 16, 2020
PubMed
Summary

This study simplifies proving lower bounds for evolutionary algorithms by introducing a new negative drift theorem. This method yields explicit bounds, revealing super-polynomial runtimes under specific conditions.

Keywords:
Runtime analysisdiscrete optimization.drift analysislower boundstheory

More Related Videos

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis
06:44

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis

Published on: September 23, 2025

329
Probing the Limits of Egg Recognition Using Egg Rejection Experiments Along Phenotypic Gradients
07:34

Probing the Limits of Egg Recognition Using Egg Rejection Experiments Along Phenotypic Gradients

Published on: August 22, 2018

8.5K

Related Experiment Videos

Last Updated: Nov 30, 2025

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli
15:00

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli

Published on: August 18, 2023

4.0K
Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis
06:44

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis

Published on: September 23, 2025

329
Probing the Limits of Egg Recognition Using Egg Rejection Experiments Along Phenotypic Gradients
07:34

Probing the Limits of Egg Recognition Using Egg Rejection Experiments Along Phenotypic Gradients

Published on: August 22, 2018

8.5K

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Algorithm Analysis

Background:

  • Proving lower bounds for non-elitist population-based evolutionary algorithms is often complex due to negative drift theorems.
  • Existing methods require technically demanding analyses, hindering broader application.

Purpose of the Study:

  • To develop a simpler negative drift theorem for multiplicative drift scenarios.
  • To simplify and strengthen existing methods for proving lower bounds on evolutionary algorithm runtimes.
  • To derive explicit, rather than asymptotic, lower bounds for algorithm performance.

Main Methods:

  • Proposed a simplified negative drift theorem applicable to multiplicative drift.
  • Re-analyzed Lehre's (2010) negative drift in populations method, reducing verification conditions.
  • Employed a novel domination argument to establish exponential lower bounds.

Main Results:

  • The new theorem simplifies existing analyses and strengthens Lehre's method, requiring fewer conditions.
  • Derived explicit lower bounds, demonstrating super-polynomial runtimes when reproduction rates decrease.
  • Extended existing results for uniform mixing and heavy-tailed mutation operators.
  • Proved an exponential lower bound for the simple genetic algorithm on OneMax.

Conclusions:

  • The proposed method offers a more accessible and powerful tool for analyzing evolutionary algorithms.
  • Explicit lower bounds provide concrete insights into algorithm performance and limitations.
  • The findings have implications for understanding the efficiency of evolutionary computation, particularly for mutation-based algorithms.