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

Pole and System Stability01:24

Pole and System Stability

298
The transfer function is a fundamental concept representing the ratio of two polynomials. The numerator and denominator encapsulate the system's dynamics. The zeros and poles of this transfer function are critical in determining the system's behavior and stability.
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's...
298
Control System Problem01:21

Control System Problem

118
In an open-loop system, such as a basic thermostat, the poles of the transfer function influence the system's response but do not determine its stability. However, when feedback is introduced to form a closed-loop system, such as an advanced thermostat that adjusts heating based on room temperature, stability is governed by the new poles of the closed-loop transfer function.
When forming a closed-loop system, issues can arise if the poles cross into the unstable region, leading to potential...
118
BIBO stability of continuous and discrete -time systems01:24

BIBO stability of continuous and discrete -time systems

398
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
398
Stability of Equilibrium Configuration: Problem Solving01:13

Stability of Equilibrium Configuration: Problem Solving

606
The stability of equilibrium configurations is an important concept in physics, engineering, and other related fields. In simple terms, it refers to the tendency of an object or system to return to its equilibrium position after being disturbed. The stability of an equilibrium configuration can be analyzed by considering the potential energy function of the system and examining its behavior near the equilibrium point.
Problem-solving in the context of the stability of equilibrium configuration...
606
Root Loci for Positive-Feedback Systems01:23

Root Loci for Positive-Feedback Systems

122
The Hartley oscillator is a positive feedback system that sustains oscillations by feeding the output back to the input in phase, thereby reinforcing the signal. Positive feedback systems can be viewed as negative feedback systems with inverted feedback signals. In these systems, the root locus encompasses all points on the s-plane where the angle of the system transfer function equals 360 degrees.
The construction rules for the root locus in positive feedback systems are similar to those in...
122
Stability of Equilibrium Configuration01:23

Stability of Equilibrium Configuration

448
Understanding the stability of equilibrium configurations is a fundamental part of mechanical engineering. In any system, there are three distinct types of equilibrium: stable, neutral, and unstable.
A stable equilibrium occurs when a system tends to return to its original position when given a small displacement, and the potential energy is at its minimum. An example of a stable equilibrium is when a cantilever beam is fixed at one end and a weight is attached to the other end. If the weight...
448

You might also read

Related Articles

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

Sort by
Same author

Attractor-Based Models for Sequences and Pattern Generation in Neural Circuits.

Neural computation·2026
Same author

Topological analysis of neuronal assemblies reveals low-rank structure modulated by cholinergic activity.

bioRxiv : the preprint server for biology·2025
Same author

Central Adiposity and Visceral Fat in Long-Term Survivors of Acute Lymphoblastic Leukemia in Childhood and Adolescence: Exploration of an Underappreciated Risk.

Pediatric blood & cancer·2025
Same author

Diet quality in relation to serum perfluoroalkyl substance concentrations in Canadian preadolescents.

Environmental research·2025
Same author

Topological Neuroscience: Linking Circuits to Function.

Annual review of neuroscience·2025
Same author

AAHPM Assessment Workgroup: Hospice and Palliative Medicine Fellowship Assessment Needs and Directions.

Journal of pain and symptom management·2024
Same journal

Geometry of the space of phylogenetic trees with non-identical leaves.

Advances in applied mathematics·2026
Same journal

Enumeration of coalescent histories for caterpillar species trees and <i>p</i>-pseudocaterpillar gene trees.

Advances in applied mathematics·2021
Same journal

Horizontal visibility graph of a random restricted growth sequence.

Advances in applied mathematics·2021
Same journal

Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees.

Advances in applied mathematics·2020
Same journal

ENUMERATION OF LONELY PAIRS OF GENE TREES AND SPECIES TREES BY MEANS OF ANTIPODAL CHERRIES.

Advances in applied mathematics·2019
Same journal

RECOVERING A TREE FROM THE LENGTHS OF SUBTREES SPANNED BY A RANDOMLY CHOSEN SEQUENCE OF LEAVES.

Advances in applied mathematics·2018
See all related articles

Related Experiment Video

Updated: Jul 5, 2025

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.2K

Stable fixed points of combinatorial threshold-linear networks.

Carina Curto, Jesse Geneson, Katherine Morrison

    Advances in Applied Mathematics
    |January 22, 2024
    PubMed
    Summary
    This summary is machine-generated.

    Combinatorial threshold-linear networks (CTLNs) dynamics are governed by graphs. This study proves that target-free cliques in CTLN graphs are the sole stable fixed points, enhancing associative memory models.

    Keywords:
    153492Collatz-Wielandt formulaattractor neural networkscliquesstable fixed pointsthreshold-linear networks

    More Related Videos

    A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
    07:34

    A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

    Published on: March 25, 2014

    9.9K
    Generating Strictly Controlled Stimuli for Figure Recognition Experiments
    05:39

    Generating Strictly Controlled Stimuli for Figure Recognition Experiments

    Published on: March 18, 2019

    5.2K

    Related Experiment Videos

    Last Updated: Jul 5, 2025

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
    10:44

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

    Published on: December 7, 2021

    2.2K
    A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
    07:34

    A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

    Published on: March 25, 2014

    9.9K
    Generating Strictly Controlled Stimuli for Figure Recognition Experiments
    05:39

    Generating Strictly Controlled Stimuli for Figure Recognition Experiments

    Published on: March 18, 2019

    5.2K

    Area of Science:

    • Computational neuroscience
    • Graph theory
    • Machine learning

    Background:

    • Recurrent neural networks, including combinatorial threshold-linear networks (CTLNs), are utilized as models for associative memory and pattern completion.
    • Stable fixed points in these networks represent stored memory patterns.
    • Prior research established a correspondence between target-free cliques in CTLN graphs and stable fixed points, with a conjecture that these are the only possible stable fixed points.

    Purpose of the Study:

    • To mathematically prove the conjecture that target-free cliques are the only stable fixed points in combinatorial threshold-linear networks.
    • To explore the conditions and limitations under which this conjecture holds.
    • To establish bounds on the number of stable fixed points in CTLNs.

    Main Methods:

    • Mathematical proof of the conjecture for specific network and graph properties (e.g., strong inhibition, small graph size).
    • Analysis of graph structures (sparse and near-clique graphs) to demonstrate the absence of stable fixed points.
    • Application of extremal combinatorics to derive bounds on the number of stable fixed points.

    Main Results:

    • The conjecture that target-free cliques correspond to the only stable fixed points is proven for several special cases of CTLNs.
    • Evidence is provided that sparse graphs and graphs that are nearly cliques do not support stable fixed points.
    • An upper bound on the number of stable fixed points is derived using results from extremal combinatorics.

    Conclusions:

    • The study confirms the conjecture for specific CTLN configurations, solidifying the link between graph structure and network dynamics.
    • The findings contribute to a deeper understanding of associative memory models and pattern completion in neural networks.
    • The derived bounds offer insights into the capacity and complexity of CTLNs as memory systems.