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

Dimensionless Groups in Fluid Mechanics01:15

Dimensionless Groups in Fluid Mechanics

Dimensionless groups in fluid mechanics provide simplified ratios that help analyze fluid behavior without relying on specific units. The Reynolds number (Re), which represents the ratio of inertial to viscous forces, distinguishes between laminar and turbulent flows, making it essential in the design of pipelines and aerodynamic surfaces. The Froude number (Fr), the ratio of inertial to gravitational forces, is particularly useful in predicting wave formation and hydraulic jumps in...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
Network Covalent Solids02:18

Network Covalent Solids

Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Region of Convergence of Laplace Tarnsform01:20

Region of Convergence of Laplace Tarnsform

The Region of Convergence (ROC) is a fundamental concept in signal processing and system analysis, particularly associated with the Laplace transform. The ROC represents an area in the complex plane where the Laplace transform of a given signal converges, determining the transform's applicability and utility.
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

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

You might also read

Related Articles

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

Sort by
Same author

Perspective on the paper: GDR MiDi. On dense granular flows.

The European physical journal. E, Soft matter·2026
Same author

Allometric scaling of brain activity explained by avalanche criticality.

Journal of the Royal Society, Interface·2026
Same author

Beyond mobility: A prospective study on diet and metabolism in hereditary spastic paraplegia.

Metabolic brain disease·2026
Same author

Evolving spatiotemporal patterns and urban scaling of deaths from external causes.

Scientific reports·2026
Same author

Forest fire as a temperature-pattern-driven depinning problem.

Physical review. E·2025
Same author

Critical exponents for isotropically directed percolation on hierarchical lattices.

Physical review. E·2025

Related Experiment Video

Updated: May 18, 2026

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

Box-covering algorithm for fractal dimension of complex networks.

Christian M Schneider1, Tobias A Kesselring, José S Andrade

  • 1Computational Physics, Institute for Building Materials, Eidgenössische Technische Hochschule Zürich, Schafmattstrasse 6, 8093 Zurich, Switzerland. schnechr@mit.edu

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|September 26, 2012
PubMed
Summary

We developed a novel box-covering algorithm to analyze complex network self-similarity. This new method significantly improves upon existing techniques, showing substantial gains for networks like the World Wide Web (WWW).

More Related Videos

Quantifying Fibrillar Collagen Organization with Curvelet Transform-Based Tools
07:58

Quantifying Fibrillar Collagen Organization with Curvelet Transform-Based Tools

Published on: November 11, 2020

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Related Experiment Videos

Last Updated: May 18, 2026

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

Quantifying Fibrillar Collagen Organization with Curvelet Transform-Based Tools
07:58

Quantifying Fibrillar Collagen Organization with Curvelet Transform-Based Tools

Published on: November 11, 2020

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Area of Science:

  • Network science
  • Computational complexity theory
  • Data analysis

Background:

  • Self-similarity is a key property of complex networks.
  • Traditional analysis relies on box-covering algorithms to quantify this property.
  • Existing algorithms face limitations in efficiency and accuracy.

Purpose of the Study:

  • To introduce a novel and improved box-covering algorithm for network self-similarity analysis.
  • To demonstrate the superior performance of the new algorithm compared to existing methods.
  • To quantify the performance improvement on benchmark complex networks.

Main Methods:

  • Development of a new box-covering algorithm.
  • Testing the algorithm on benchmark complex networks: E. coli and World Wide Web (WWW).
  • Comparison of the new algorithm's performance against established methods.

Main Results:

  • The proposed box-covering algorithm demonstrates superior performance in most tested cases.
  • Substantial improvements were observed, particularly for the World Wide Web (WWW) network, reaching up to 15%.
  • The algorithm effectively covers complex network structures with a minimal number of boxes.

Conclusions:

  • The new box-covering algorithm offers a more efficient and accurate approach to studying network self-similarity.
  • This advancement has significant implications for understanding the structure and properties of complex systems.
  • The findings suggest potential for broader applications in network analysis and modeling.