Jove
Visualize
Contact Us

Related Concept Videos

Survival Tree01:19

Survival Tree

172
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
172
Phylogenetic Trees03:21

Phylogenetic Trees

47.8K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
47.8K
Spanning Openings in Brick Walls01:20

Spanning Openings in Brick Walls

310
In brick wall construction, supporting structures are crucial for openings like windows and doors to maintain the integrity and support the weight of the wall above. These supports include lintels, corbels, and arches, each serving specific structural purposes.
Lintels are primary supports used to span openings and can be crafted from materials such as reinforced concrete, steel-reinforced brick masonry, or simple steel angles. These are straightforward to install and are typically concealed...
310
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

158
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
158
Scaling01:26

Scaling

333
In designing and analyzing filters, resonant circuits, or circuit analysis at large, working with standard element values like 1 ohm, 1 henry, or 1 farad can be convenient before scaling these values to more realistic figures. This approach is widely utilized by not employing realistic element values in numerous examples and problems; it simplifies mastering circuit analysis through convenient component values. The complexity of calculations is thereby reduced, with the understanding that...
333
Time-Series Graph00:54

Time-Series Graph

4.6K
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.6K

You might also read

Related Articles

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

Sort by
Same author

Empirical discovery of multiscale transfer of information in dynamical systems.

Physical review. E·2026
Same author

Tree-based learning for high-fidelity prediction of chaos.

Scientific reports·2025
Same author

Modeling resource consumption in the US air transportation system via minimum-cost percolation.

Nature communications·2025
Same author

Generalizing geometric partition entropy for the estimation of mutual information in the presence of informative outliers.

Chaos (Woodbury, N.Y.)·2025
Same author

Fractal Conditional Correlation Dimension Infers Complex Causal Networks.

Entropy (Basel, Switzerland)·2025
Same author

Contrasting topologies of synchronous and asynchronous functional brain networks.

Network neuroscience (Cambridge, Mass.)·2024
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: Sep 30, 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.2K

Spanning trees of recursive scale-free graphs.

C Tyler Diggans1,2,3, Erik M Bollt1,4, Daniel Ben-Avraham1,2

  • 1Clarkson Center for Complex Systems Science, Clarkson University, Potsdam, New York 13699, USA.

Physical Review. E
|March 16, 2022
PubMed
Summary
This summary is machine-generated.

We developed a method to construct all spanning trees for recursive graphs. This approach allows analytical solutions for network properties and optimization problems, enhancing recursive graphs as complex network models.

More Related Videos

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.5K
Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.1K

Related Experiment Videos

Last Updated: Sep 30, 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.2K
Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.5K
Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.1K

Area of Science:

  • Graph theory
  • Network science
  • Statistical physics

Background:

  • Recursive graphs, like the Dorogovtsev-Goltsev-Mendes (DGM) net, are increasingly used to model complex real-world networks.
  • Understanding the properties of spanning trees within these networks is crucial for analyzing network behavior and optimizing their structure.
  • Existing methods may not efficiently capture the full ensemble of spanning trees for recursively generated graphs.

Purpose of the Study:

  • To introduce a novel link-by-link rule-based method for constructing the complete ensemble of spanning trees for recursive graphs.
  • To demonstrate how this method enables exact analytical solutions for large-scale properties of spanning tree ensembles.
  • To show the application of these rules in selecting specific spanning trees with desired properties for network optimization.

Main Methods:

  • A link-by-link rule-based construction algorithm for generating all spanning trees of recursive graphs.
  • Analytical techniques to solve for large-scale properties of the ensemble of spanning trees.
  • Application of growth rules to select subsets of spanning trees with targeted characteristics (e.g., small-world, extended diameter, specific degree distributions).

Main Results:

  • The method successfully constructs all members of the spanning tree ensemble for recursively generated graphs.
  • Exact analytical solutions were obtained for various large-scale properties of these ensembles.
  • The rule-based selection process effectively identifies spanning trees relevant to optimization problems on networks.

Conclusions:

  • The developed method provides a powerful tool for analyzing the ensemble of spanning trees in recursive graphs.
  • This work enhances the utility of recursive graphs as sophisticated models for complex networks.
  • The findings offer new approaches to network analysis and optimization problems by leveraging the structure of spanning trees.