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

Relative Velocity in One Dimension01:10

Relative Velocity in One Dimension

The understanding of the concept of reference frames is essential to discuss relative motion in one or more dimensions. When we say that an object has a certain velocity, we must state the velocity with respect to a given reference frame. In most examples, this reference frame has been Earth. For instance, if a statement reads that a person is sitting in a train moving at 10 m/s east, then it implies that the person on the train is moving relative to the surface of Earth at this velocity,...
Short-distance Transport of Resources02:12

Short-distance Transport of Resources

Short-distance transport refers to transport that occurs over a distance of just 2-3 cells, crossing the plasma membrane in the process. Small uncharged molecules, such as oxygen, carbon dioxide, and water, can diffuse across the plasma membrane on their own. In contrast, ions and larger molecules require the assistance of transport proteins due to their charge or size. Transport across membranes also occurs within individual cells, playing a variety of essential roles for the plant as a whole.
Relative Velocity in Two Dimensions01:11

Relative Velocity in Two Dimensions

Relative velocity is the velocity of an object as observed from a particular reference frame, or the velocity of one reference frame with respect to another reference frame. The concept of relative velocity can be used to describe motion in two dimensions. Consider a particle P and two reference frames S and S′. The position of the origin of S′ as measured in S is , the position of P as measured in S′ is , and the position of P as measured in S is , which can be evaluated by utilizing vector...
Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Vectors in Space: Problem Solving01:26

Vectors in Space: Problem Solving

A chandelier suspended by multiple cables can be analyzed using principles of three-dimensional static equilibrium. In this setup, a chandelier weighing 1000 N is positioned at the origin of a three-dimensional coordinate system, while three ceiling anchor points are fixed at known locations above it. Each cable connects the chandelier to one anchor point and transmits a tensile force along its length.To find out the forces in the cables, the spatial direction of each cable must first be...
Collisions in Multiple Dimensions: Introduction01:05

Collisions in Multiple Dimensions: Introduction

It is far more common for collisions to occur in two dimensions; that is, the initial velocity vectors are neither parallel nor antiparallel to each other. Let's see what complications arise from this. The first idea is that momentum is a vector. Like all vectors, it can be expressed as a sum of perpendicular components (usually, though not always, an x-component and a y-component, and a z-component if necessary). Thus, when the statement of conservation of momentum is written for a problem,...

You might also read

Related Articles

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

Sort by
Same author

Extracting the transitivity backbone of bipartite networks.

Nature communications·2026
Same author

HypBench: Hyperbolic Benchmark for Graph Neural Network Performance.

IEEE transactions on neural networks and learning systems·2026
Same author

Clustering Does Not Always Imply Latent Geometry.

Physical review letters·2025
Same author

Statistical Mechanics of Directed Networks.

Entropy (Basel, Switzerland)·2025
Same author

Renormalization of networks with weak geometric coupling.

Physical review. E·2024
Same author

Random hyperbolic graphs in d+1 dimensions.

Physical review. E·2024
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Related Experiment Video

Updated: Jun 25, 2026

Assessing Human Spatial Navigation in a Virtual Space and its Sensitivity to Exercise
06:17

Assessing Human Spatial Navigation in a Virtual Space and its Sensitivity to Exercise

Published on: January 26, 2024

Navigating ultrasmall worlds in ultrashort time.

Marián Boguñá1, Dmitri Krioukov

  • 1Departament de Física Fonamental, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain.

Physical Review Letters
|March 5, 2009
PubMed
Summary
This summary is machine-generated.

Random scale-free networks, or ultrasmall worlds, allow efficient navigation. Greedy routing using local information finds near-shortest paths, crucial for large communication systems like the Internet.

More Related Videos

Development of an Audio-based Virtual Gaming Environment to Assist with Navigation Skills in the Blind
09:01

Development of an Audio-based Virtual Gaming Environment to Assist with Navigation Skills in the Blind

Published on: March 27, 2013

Two-photon Calcium Imaging in Mice Navigating a Virtual Reality Environment
08:12

Two-photon Calcium Imaging in Mice Navigating a Virtual Reality Environment

Published on: February 20, 2014

Related Experiment Videos

Last Updated: Jun 25, 2026

Assessing Human Spatial Navigation in a Virtual Space and its Sensitivity to Exercise
06:17

Assessing Human Spatial Navigation in a Virtual Space and its Sensitivity to Exercise

Published on: January 26, 2024

Development of an Audio-based Virtual Gaming Environment to Assist with Navigation Skills in the Blind
09:01

Development of an Audio-based Virtual Gaming Environment to Assist with Navigation Skills in the Blind

Published on: March 27, 2013

Two-photon Calcium Imaging in Mice Navigating a Virtual Reality Environment
08:12

Two-photon Calcium Imaging in Mice Navigating a Virtual Reality Environment

Published on: February 20, 2014

Area of Science:

  • Network Science
  • Computer Science
  • Information Theory

Background:

  • Random scale-free networks exhibit an 'ultrasmall world' property.
  • The average shortest path length in these networks scales as ln(ln(N)).
  • Efficient navigation in large networks is challenging due to the need for global topological knowledge.

Purpose of the Study:

  • To investigate the efficiency of greedy routing on scale-free networks.
  • To determine if local information is sufficient for near-optimal pathfinding.
  • To assess the implications for communication systems.

Main Methods:

  • Analyzing greedy routing algorithms on scale-free networks embedded in metric spaces.
  • Comparing path lengths found by greedy routing with actual shortest paths.
  • Mathematical analysis of path length scaling.

Main Results:

  • Greedy routing on scale-free networks achieves an average path length scaling of ln(ln(N)).
  • This routing method, using only local information, asymptotically finds the shortest paths.
  • The network's inherent structure compensates for the lack of global topological awareness.

Conclusions:

  • Complex network structures enable efficient navigation using local information.
  • Greedy routing offers a scalable solution for communication systems like the Internet.
  • Reduces the bottleneck associated with maintaining global network topology knowledge.