Jove
Visualize
Contact Us

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

11.5K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
11.5K
Time-Series Graph00:54

Time-Series Graph

4.2K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
4.2K
Cyclic Processes And Isolated Systems01:19

Cyclic Processes And Isolated Systems

2.7K
A thermodynamic system with zero heat exchange and work is an isolated system. For these systems, the internal energy remains constant.
In the case of a non-isolated system, the change in the internal energy is zero only if the process is cyclic. A thermodynamic process is considered cyclic if the system undergoes a series of changes and returns to its initial state. 
Consider a cyclic process that returns to its initial state, undergoing a four-step process. The heat transfer along each...
2.7K
Plotting of Topographic Maps01:29

Plotting of Topographic Maps

17
Topographic maps represent the Earth's surface features using contour lines, which connect points of equal elevation to create a two-dimensional representation of three-dimensional terrain. Creating a topographic map requires a systematic approach.Begin by plotting a scaled grid and marking intersections corresponding to the survey's elevation data points. Assign elevation values at these intersections to build the base map. Next, determine contour levels using a consistent contour interval,...
17
Ogive Graph01:07

Ogive Graph

5.5K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
5.5K
Mohr's Circle for Plane Strain01:18

Mohr's Circle for Plane Strain

370
Mohr's circle is a crucial graphical method used to analyze plane strain by plotting strain on a set of cartesian coordinates, where the abscissa is normal strain ∈ and the ordinate is shear strain γ. Similarly to Mohr’s circle for plane stress, two points X and Y are plotted. Their coordinates are (∈x, -γXY) and (∈Y, γXY), respectively.
Mohr's circle visually represents the strain states under various conditions, which is essential for...
370

You might also read

Related Articles

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

Sort by
Same author

Fixation times on directed graphs.

PLoS computational biology·2024
Same author

Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating.

PLoS computational biology·2024
Same author

Evolutionary dynamics of mutants that modify population structure.

Journal of the Royal Society, Interface·2023
Same author

Mutation enhances cooperation in direct reciprocity.

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

Fast and strong amplifiers of natural selection.

Nature communications·2021
Same author

Limits on amplifiers of natural selection under death-Birth updating.

PLoS computational biology·2020
Same journal

Another 10 years of PLOS Computational Biology: A data-driven reflection on trends in genomics research.

PLoS computational biology·2026
Same journal

Mobility data resolution needed to inform predictive models of spatial epidemic spread from mobile phone data.

PLoS computational biology·2026
Same journal

DeepMethylation: A deep learning framework for tissue-specific DNA methylation prediction and functional variant annotation.

PLoS computational biology·2026
Same journal

Redefining and estimating the early-phase reproduction ratio for epidemic outbreaks in spatially structured populations.

PLoS computational biology·2026
Same journal

Optimized phenotype definitions boost GWAS power.

PLoS computational biology·2026
Same journal

Detection, communication, and individual identification with deep audio embeddings: A case study with North Atlantic right whales.

PLoS computational biology·2026
See all related articles
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 Experiment Video

Updated: May 9, 2025

Mycorrhizal Maps as a Tool to Explore Colonization Patterns and Fungal Strategies in the Roots of Festuca rubra and Zea mays
08:28

Mycorrhizal Maps as a Tool to Explore Colonization Patterns and Fungal Strategies in the Roots of Festuca rubra and Zea mays

Published on: August 26, 2022

2.6K

Colonization times in Moran process on graphs.

Lenka Kopfová1,2, Josef Tkadlec1

  • 1Computer Science Institute, Charles University, Prague, Czech Republic.

Plos Computational Biology
|May 5, 2025
PubMed
Summary
This summary is machine-generated.

Colonization time in spatially structured populations, modeled by the Moran process, is always polynomial in population size. This study provides tighter bounds for different graph structures and suggests measuring real process duration.

More Related Videos

Monitoring Spatial Segregation in Surface Colonizing Microbial Populations
07:40

Monitoring Spatial Segregation in Surface Colonizing Microbial Populations

Published on: October 29, 2016

10.1K
Quantification of Orofacial Phenotypes in Xenopus
09:26

Quantification of Orofacial Phenotypes in Xenopus

Published on: November 6, 2014

9.7K

Related Experiment Videos

Last Updated: May 9, 2025

Mycorrhizal Maps as a Tool to Explore Colonization Patterns and Fungal Strategies in the Roots of Festuca rubra and Zea mays
08:28

Mycorrhizal Maps as a Tool to Explore Colonization Patterns and Fungal Strategies in the Roots of Festuca rubra and Zea mays

Published on: August 26, 2022

2.6K
Monitoring Spatial Segregation in Surface Colonizing Microbial Populations
07:40

Monitoring Spatial Segregation in Surface Colonizing Microbial Populations

Published on: October 29, 2016

10.1K
Quantification of Orofacial Phenotypes in Xenopus
09:26

Quantification of Orofacial Phenotypes in Xenopus

Published on: November 6, 2014

9.7K

Area of Science:

  • Population dynamics
  • Stochastic processes
  • Mathematical biology

Background:

  • The Moran birth-death process models natural selection in structured populations.
  • Invasion dynamics depend on population size and spatial structure.
  • Previous models often assume reproducing residents.

Purpose of the Study:

  • Analyze colonization time in a Moran process with non-reproducing residents.
  • Establish upper bounds for colonization time based on population size and graph structure.
  • Propose alternative measurement for process duration.

Main Methods:

  • Mathematical analysis of the Moran process on graphs.
  • Derivation of upper bounds for expected colonization time.
  • Identification of worst-case graph structures.

Main Results:

  • Colonization time is bounded by a polynomial function of population size n, specifically O(n^2).
  • Tighter bounds established: O(n log n) for undirected graphs and O(n) for regular graphs.
  • Identified specific graphs achieving these bounds.

Conclusions:

  • Colonization in empty environments is computationally tractable, with predictable time bounds.
  • The spatial structure significantly impacts colonization duration.
  • Measuring real process duration is recommended over abstract step counts for practical applications.