Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Neural Circuits

Neural Circuits

Neural circuits and neuronal pools are two of the main structures found in the nervous system. Neural circuits are networks of neurons that work together to carry out a specific task or process. They consist of interconnected neurons and glial cells, which provide structural and metabolic support.
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...

Direct Motor Pathways

Direct Motor Pathways

The direct motor pathways, also known as the pyramidal tracts, are a group of neural pathways that originate in the brain and descend through the spinal cord. They control the voluntary movement of the body. There are two major direct motor pathways: the corticospinal and the corticobulbar tracts.
The corticospinal tract is responsible for the voluntary movement of the limbs and trunk. It originates in the cerebral cortex of the brain and descends through the cerebrum's internal capsule and...

Parallel Processing

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...

You might also read

Related Articles

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

Sort by

Same author

Global Burden of Pediatric Cardiovascular Diseases of Congenital and Non-Congenital Trends from 1992 to 2021.

Communications medicine·2026

Same author

The unbearable slowness of being: Why do we live at 10 bits/s?

Neuron·2024

Same author

Perceptual tri-stability, measured and fitted as emergent from a model for bistable alternations.

Hearing research·2024

Same author

A Fast Algorithm for All-Pairs-Shortest-Paths Suitable for Neural Networks.

Neural computation·2024

Same author

Endotaxis: A neuromorphic algorithm for mapping, goal-learning, navigation, and patrolling.

eLife·2024

Same author

Evolution of neuronal cell classes and types in the vertebrate retina.

Nature·2023

Same journal

Poisoning the Genome: Targeted Backdoor Attacks on DNA Foundation Models.

ArXiv·2026

Same journal

Mechanistic mathematical model of the in vitro infection dynamics of Bunyamwera and Batai viruses including MOI-dependent shortening of the eclipse phase.

ArXiv·2026

Same journal

AI-Driven Lumped-Element Modeling of Human Respiratory System for Studying Voice Mechanics.

ArXiv·2026

Same journal

Beyond Algorithms: Conceptual Innovation in Medical Imaging AI.

ArXiv·2026

Same journal

Feynman Kac Reweighted Schrödinger Bridge Matching for Surface-Based Tau PET Harmonization.

ArXiv·2026

Same journal

Agentic Discovery of Non-Canonical Antimicrobial Peptides with AMPGAN v3.

ArXiv·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 17, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks.

Zeyu Jing¹, Markus Meister¹

¹Division of Biology and Biological Engineering California Institute of Technology.

|August 7, 2024

Summary

This summary is machine-generated.

Finding shortest paths in graphs is simplified using matrix inversion. This novel method offers a computationally faster alternative for dense graphs and extends to weighted graphs, paving the way for neural network solutions.

More Related Videos

Rewiring Neuronal Circuits: A New Method for Fast Neurite Extension and Functional Neuronal Connection

Rewiring Neuronal Circuits: A New Method for Fast Neurite Extension and Functional Neuronal Connection

Published on: June 13, 2017

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

Related Experiment Videos

Last Updated: Jun 17, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

Rewiring Neuronal Circuits: A New Method for Fast Neurite Extension and Functional Neuronal Connection

Rewiring Neuronal Circuits: A New Method for Fast Neurite Extension and Functional Neuronal Connection

Published on: June 13, 2017

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

Area of Science:

Graph Theory
Numerical Analysis
Computer Science

Background:

The shortest path problem is a fundamental challenge in graph theory.
Existing algorithms can be computationally intensive, especially for large or dense graphs.

Purpose of the Study:

To introduce a novel matrix inversion method for calculating shortest path distances.
To analyze the method's accuracy, efficiency, and applicability to various graph types.

Main Methods:

Utilizing matrix inversion with a modified adjacency matrix.
Deriving graph-theoretic bounds for a key parameter.
Performing numerical experiments on diverse graph structures.

Main Results:

Shortest path distances can be accurately computed via matrix inversion for a suitably small parameter value.
The method demonstrates local accuracy even when global accuracy is not achieved.
It extends to weighted graphs and is computationally faster than alternatives for dense graphs.

Conclusions:

Matrix inversion provides an efficient and versatile approach to the all-pairs-shortest-path problem.
This method naturally integrates with neural network architectures for further optimization.