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

Protein Networks

Protein Networks

An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...

The Extracellular Matrix

The Extracellular Matrix

Measures of Central Tendency

Measures of Central Tendency

The "center" of a data set is also a way of describing location. The two most widely used measures of the "center" of the data are the mean (average) and the median. The words "mean" and "average" are often used interchangeably. The substitution of one word for the other is common practice. The technical term is "arithmetic mean" and "average" is technically a center location. However, in practice among non-statisticians,...

The Central Dogma

The Central Dogma

The Central Dogma

The Central Dogma

The central dogma explains the flow of genetic information from DNA nucleotides to the amino acid sequence of proteins.
RNA is the Missing Link Between DNA and Proteins
In the early 1900s, scientists discovered that DNA stores all the information needed for cellular functions and that proteins perform most of these functions. However, the mechanisms of converting genetic information into functional proteins remained unknown for many years. Initially, it was believed that a single gene is...

Network Covalent Solids

Network Covalent Solids

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

You might also read

Related Articles

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

Sort by

Same author

How adversarial attacks can disrupt seemingly stable accurate classifiers.

Neural networks : the official journal of the International Neural Network Society·2024

Same author

Estimating network dimension when the spectrum struggles.

Royal Society open science·2024

Same author

Connectivity of Random Geometric Hypergraphs.

Entropy (Basel, Switzerland)·2023

Same author

Generative hypergraph models and spectral embedding.

Scientific reports·2023

Same author

Epidemics on hypergraphs: spectral thresholds for extinction.

Proceedings. Mathematical, physical, and engineering sciences·2022

Same author

Directed network Laplacians and random graph models.

Royal Society open science·2021

Same journal

Changes in patient-sharing patterns after oncologist departures in rural and urban settings: a Medicare cohort study.

Applied network science·2026

Same journal

Tunable network properties with Hamill and Gilbert's Social Circles generator.

Applied network science·2025

Same journal

Initialisation and network effects in decentralised federated learning.

Applied network science·2025

Same journal

The association of prescriber prominence in a shared-patient physician network with their patients receipt of and transitions between risky drug combinations.

Applied network science·2025

Same journal

Accounting for contact network uncertainty in epidemic inferences with Approximate Bayesian Computation.

Applied network science·2025

Same journal

Navigation on temporal networks.

Applied network science·2025

See all related articles

Search research articles

Related Experiment Video

Updated: Feb 2, 2026

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

Sparse matrix computations for dynamic network centrality.

Francesca Arrigo¹, Desmond J Higham¹

¹University of Strathclyde, 16 Richmond St, Glasgow, G1 1XQ UK.

Applied Network Science

|November 17, 2018

Summary

This summary is machine-generated.

This study introduces a new algorithm for efficiently calculating time-dependent network centrality. It accurately identifies key nodes in dynamic human interaction networks while significantly reducing computational costs and storage needs.

Keywords:

Centrality Dynamic network Katz centrality Social network analysis Sparsification

More Related Videos

Photodiode-Based Optical Imaging for Recording Network Dynamics with Single-Neuron Resolution in Non-Transgenic Invertebrates

Photodiode-Based Optical Imaging for Recording Network Dynamics with Single-Neuron Resolution in Non-Transgenic Invertebrates

Published on: July 9, 2020

Dynamic Quantitative Sensory Testing to Characterize Central Pain Processing

Dynamic Quantitative Sensory Testing to Characterize Central Pain Processing

Published on: February 16, 2017

Related Experiment Videos

Last Updated: Feb 2, 2026

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

Photodiode-Based Optical Imaging for Recording Network Dynamics with Single-Neuron Resolution in Non-Transgenic Invertebrates

Photodiode-Based Optical Imaging for Recording Network Dynamics with Single-Neuron Resolution in Non-Transgenic Invertebrates

Published on: July 9, 2020

Dynamic Quantitative Sensory Testing to Characterize Central Pain Processing

Dynamic Quantitative Sensory Testing to Characterize Central Pain Processing

Published on: February 16, 2017

Area of Science:

Network Science
Computational Social Science
Data Analysis

Background:

Time-sliced networks of human interactions (social media, calls) are large and sparse.
Quantifying time-dependent network centrality is computationally expensive due to dense matrix representations.
Existing methods struggle with the storage and computational demands of dynamic network analysis.

Purpose of the Study:

To develop an efficient algorithm for computing time-dependent centrality in dynamic networks.
To reduce the computational and storage burden associated with analyzing large, sparse temporal networks.
To accurately capture evolving node importance in human-human digital interactions.

Main Methods:

Derived a novel algorithm for time-dependent centrality based on dynamic communicability.
Employed a sparsified version of the dynamic communicability matrix to reduce complexity.
Validated the algorithm on a large-scale dataset, testing stringent sparsity constraints.

Main Results:

The new algorithm significantly reduces computation and storage requirements to sparse, static network levels.
Even with high sparsity, the algorithm accurately identifies highly central nodes compared to full systems.
The method scales linearly with the number of time points, enabling efficient analysis of long time series.

Conclusions:

The proposed algorithm offers an efficient and accurate solution for dynamic network centrality analysis.
It enables practical computation of time-dependent centrality for large-scale human interaction networks.
Variants of the algorithm further reduce computational cost and parameter dependency.