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

Distribution and Dispersion00:54

Distribution and Dispersion

22.7K
To understand intra-specific interactions in populations, scientists measure the spatial arrangement of species individuals. This geographic arrangement is known as the species distribution or dispersion. Highly territorial species exhibit a uniform distribution pattern, in which individuals are spaced at relatively equal distances from one another. Species that are highly tied to particular resources, such as food or shelter, tend to concentrate around those resources, and thus exhibit a...
22.7K
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

828
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
828
Steps in Outbreak Investigation01:18

Steps in Outbreak Investigation

261
In the ever-evolving field of public health, statistical analysis serves as a cornerstone for understanding and managing disease outbreaks. By leveraging various statistical tools, health professionals can predict potential outbreaks, analyze ongoing situations, and devise effective responses to mitigate impact. For that to happen, there are a few possible stages of the analysis:
261
Parametric Survival Analysis: Weibull and Exponential Methods01:14

Parametric Survival Analysis: Weibull and Exponential Methods

719
Parametric survival analysis models survival data by assuming a specific probability distribution for the time until an event occurs. The Weibull and exponential distributions are two of the most commonly used methods in this context, due to their versatility and relatively straightforward application.
Weibull Distribution
The Weibull distribution is a flexible model used in parametric survival analysis. It can handle both increasing and decreasing hazard rates, depending on its shape parameter...
719
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

1.9K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
1.9K
Random Variables01:09

Random Variables

15.6K
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...
15.6K

You might also read

Related Articles

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

Sort by
Same authorSame journal

Fast Methods for Finding Multiple Effective Influencers in Real Networks.

Journal of research of the National Institute of Standards and Technology·2024
Same author

The Role of Rendering in the Competence Project in Measurement Science for Optical Reflection and Scattering.

Journal of research of the National Institute of Standards and Technology·2016
Same author

Constructing sequence alignments from a Markov decision model with estimated parameter values.

Applied bioinformatics·2005
Same journal

Precise Numerical Differentiation of Thermodynamic Functions with Multicomplex Variables.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

Characterization of 3-Dimensional Printing and Casting Materials for use in Computed Tomography and X-ray Imaging Phantoms.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

On The Quotient of a Centralized and a Non-centralized Complex Gaussian Random Variable.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

Disinfection of Respirators with Ultraviolet Radiation.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

DNA Origami Design: A How-To Tutorial.

Journal of research of the National Institute of Standards and Technology·2024
See all related articles

Related Experiment Video

Updated: Oct 22, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.3K

An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication.

Fern Y Hunt1

  • 1National Institute of Standards and Technology, Gaithersburg, MD 20899.

Journal of Research of the National Institute of Standards and Technology
|August 26, 2021
PubMed
Summary
This summary is machine-generated.

This study identifies optimal node subsets for rapid information spread in networks using random walks. It introduces a novel method that guarantees near-optimal solutions, improving upon traditional greedy algorithms for network communication efficiency.

Keywords:
consensus modelsfirst hitting timegreedoidsnetworksrandom walksubmodularsupermodular functions

More Related Videos

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.5K
Quantitative Analysis of Cell Edge Dynamics during Cell Spreading
10:54

Quantitative Analysis of Cell Edge Dynamics during Cell Spreading

Published on: May 22, 2021

5.6K

Related Experiment Videos

Last Updated: Oct 22, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.3K
Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.5K
Quantitative Analysis of Cell Edge Dynamics during Cell Spreading
10:54

Quantitative Analysis of Cell Edge Dynamics during Cell Spreading

Published on: May 22, 2021

5.6K

Area of Science:

  • Network Science
  • Graph Theory
  • Combinatorial Optimization

Background:

  • Information diffusion models often rely on random walks within networks.
  • Identifying optimal seeding sets for rapid information spread is a computationally challenging problem.

Purpose of the Study:

  • To determine the optimal subset of nodes for maximizing information spread speed in a network communication model.
  • To develop an efficient method for finding near-optimal solutions to this NP-hard problem.

Main Methods:

  • Modeling information spread as a process dual to random walks on undirected graphs.
  • Defining an objective function based on the sum of expected first hitting times for nodes outside a chosen set.
  • Introducing a submodular rank function to compare novel solutions with greedy algorithms.

Main Results:

  • The proposed method identifies a set of nodes with a guaranteed rank relative to the optimal set.
  • The supermodularity and non-increasing properties of the hitting time function are leveraged.
  • A trade-off between the size of evaluated sets (m) and solution quality (ν) is demonstrated.

Conclusions:

  • The developed approach offers an efficient way to find high-quality solutions for information spread optimization.
  • The method provides theoretical guarantees on solution quality compared to optimal and greedy strategies.
  • This research contributes to understanding and optimizing information dissemination in complex networks.