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

Distance Problem01:29

Distance Problem

129
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
129
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.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...
18.5K
The Distance Formula01:20

The Distance Formula

711
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
711
Graphs of Polar Equations01:17

Graphs of Polar Equations

378
The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...
378
Vector Representation of Complex Numbers01:16

Vector Representation of Complex Numbers

594
Complex numbers, represented in Cartesian coordinates, can also be visualized as vectors. These vectors can be expressed in polar form, emphasizing their magnitude and angle. When a complex number is input into a function, the output is another complex number, highlighting the function's zero point from which the vector representation can originate.
Consider a function defined as the product of the complex factors in the numerator divided by the product of the complex factors in the...
594
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

340
An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
340

You might also read

Related Articles

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

Sort by
Same author

Identifying surge of exclusionary nationalism: A case study of prewar Japan.

PloS one·2026
Same author

CauFinder: Steering Cell-State and Phenotype Transitions by Causal Disentanglement Learning.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

Quantitative Aortic Arch Calcification Is Associated with Non-ipsilateral Ischemic Lesions after Transfemoral Carotid Artery Stenting.

Neurologia medico-chirurgica·2026
Same author

Identifying the optimal rapid antigen test for screening and determining the end of isolation: A modeling study.

PLoS computational biology·2026
Same author

Force Learning in Balanced Cortical E-I Networks.

Neural computation·2026
Same author

Recurrence plot reconstruction reveals chromosomal reorganization before territory formation.

NAR genomics and bioinformatics·2026

Related Experiment Video

Updated: Mar 13, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
05:30

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

Published on: October 10, 2025

583

Graph distance for complex networks.

Yutaka Shimada1, Yoshito Hirata2, Tohru Ikeguchi1

  • 1Faculty of Engineering, Tokyo University of Science, 6-3-1 Niijuku, Katsushika-ku, Tokyo 125-8585, Japan.

Scientific Reports
|October 12, 2016
PubMed
Summary
This summary is machine-generated.

We introduce a novel graph distance metric for complex networks using Laplacian matrices. This method accurately quantifies structural differences and reveals temporal network dynamics, particularly in human interaction networks.

More Related Videos

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.6K
Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
09:32

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

Published on: December 18, 2016

13.0K

Related Experiment Videos

Last Updated: Mar 13, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
05:30

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

Published on: October 10, 2025

583
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.6K
Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
09:32

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

Published on: December 18, 2016

13.0K

Area of Science:

  • Complex Networks
  • Network Science
  • Graph Theory
  • Dynamical Systems

Background:

  • Complex networks are essential for modeling real-world systems across various scientific domains.
  • Quantifying network distance is crucial for classification, change detection, and predicting temporal evolution.
  • Existing network distance theories lack comprehensive discussion, especially concerning structural and dynamical properties.

Purpose of the Study:

  • To propose a novel graph distance metric for complex networks.
  • To develop a method that reflects both structural and dynamical properties of networked systems.
  • To validate the effectiveness of the proposed distance in quantifying network differences and analyzing temporal networks.

Main Methods:

  • Developed a graph distance metric based on the Laplacian matrix of networks.
  • The Laplacian matrix captures essential structural and dynamical characteristics of networked dynamical systems.
  • Applied the proposed distance to analyze temporal networks, specifically those representing face-to-face human interactions.

Main Results:

  • The Laplacian-based graph distance effectively quantifies the structural differences between complex networks.
  • The proposed method successfully elucidates the underlying temporal properties of observed temporal networks.
  • Demonstrated the utility of the metric in understanding dynamic changes in networks, such as human interactions over time.

Conclusions:

  • The Laplacian-based graph distance offers a robust approach to measuring network dissimilarity.
  • This metric provides valuable insights into the structural and temporal dynamics of complex systems.
  • The findings have implications for network analysis, classification, and prediction in various fields.