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

Coordination Number and Geometry02:57

Coordination Number and Geometry

19.5K
For transition metal complexes, the coordination number determines the geometry around the central metal ion. Table 1 compares coordination numbers to molecular geometry. The most common structures of the complexes in coordination compounds are octahedral, tetrahedral, and square planar.
19.5K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.6K
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.6K
Geometry of Hyperbolas01:30

Geometry of Hyperbolas

589
A hyperbola consists of all points where the absolute difference of distances to two fixed points, called foci, remains constant. The standard equation isEach branch extends infinitely and approaches two asymptotes, which guide the curve’s behavior. The parameters a and b define key features: a measures the distance from the center to each vertex along the transverse axis, while b influences the slopes of the asymptotes. The asymptotes have equationsA rectangle centered at the origin with...
589
Network Covalent Solids02:18

Network Covalent Solids

16.5K
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...
16.5K
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

355
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...
355
Circuit Terminology01:14

Circuit Terminology

3.2K
An electrical network is a system composed of interconnected elements, such as resistors, capacitors, inductors, and voltage or current sources. Unlike a circuit, an electrical network does not necessarily form a closed path. In other words, while all circuits can be considered networks due to their interconnected nature, not every network qualifies as a circuit.
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
3.2K

You might also read

Related Articles

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

Sort by
Same author

Random hyperbolic graphs in d+1 dimensions.

Physical review. E·2024
Same author

Entropy of labeled versus unlabeled networks.

Physical review. E·2022
Same author

Dynamic hidden-variable network models.

Physical review. E·2021
Same author

Sparse Power-Law Network Model for Reliable Statistical Predictions Based on Sampled Data.

Entropy (Basel, Switzerland)·2020
Same author

Vacuum Selection from Cosmology on Networks of String Geometries.

Physical review letters·2018
Same author

Stability of a giant connected component in a complex network.

Physical review. E·2018
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: Mar 20, 2026

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

Clustering Implies Geometry in Networks.

Dmitri Krioukov1

  • 1Northeastern University, Departments of Physics, Mathematics, and Electrical and Computer Engineering, Boston, Massachusetts 02115, USA.

Physical Review Letters
|June 4, 2016
PubMed
Summary
This summary is machine-generated.

Network models with latent geometry are common, but identifying geometric networks is difficult. This study reveals that high clustering and fixed expected degrees indicate geometric network properties, like those found in random geometric graphs.

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
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K

Related Experiment Videos

Last Updated: Mar 20, 2026

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.4K
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
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K

Area of Science:

  • Network science
  • Graph theory
  • Statistical physics

Background:

  • Latent geometry network models are widely applied.
  • Distinguishing geometric networks from non-geometric ones is challenging.
  • Real-world networks often exhibit complex structures.

Purpose of the Study:

  • Identify structural network properties that guarantee geometricity.
  • Establish criteria for classifying networks as geometric.
  • Connect network structure to underlying geometric principles.

Main Methods:

  • Analysis of random graph ensembles.
  • Derivation of equivalences between graph properties and geometric models.
  • Investigating the role of node degree and clustering.

Main Results:

  • Networks with fixed expected degrees and strong clustering are equivalent to random geometric graphs on a line.
  • Homogeneous distribution of triangles across nodes signifies network geometricity.
  • Developed generalizable methods for network ensemble analysis.

Conclusions:

  • High clustering is a key indicator of underlying network geometry.
  • The findings provide a method to identify geometric networks.
  • The approach has broader applicability in network science and beyond.