Forward reachable sets: Analytically derived properties of connected components for dynamic networks.

Benjamin Armbruster1, L I Wang2, Martina Morris2

  • 1Northwestern University, Industrial Engineering and Management Sciences, Evanston, IL, USA.

Network Science (Cambridge University Press)
|September 5, 2022
PubMed
Summary

We analyzed forward reachable sets (FRS) in dynamic networks, finding their growth depends on network structure and edge duration. This work offers insights into epidemic modeling and network dynamics.

Related Concept Videos

Protein Networks02:26

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,...
4.1K
Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
671
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
14.7K
SFG Algebra01:16

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
167
Circuit Terminology01:14

Circuit Terminology

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.
2.0K
Region of Convergence of Laplace Tarnsform01:20

Region of Convergence of Laplace Tarnsform

The Region of Convergence (ROC) is a fundamental concept in signal processing and system analysis, particularly associated with the Laplace transform. The ROC represents an area in the complex plane where the Laplace transform of a given signal converges, determining the transform's applicability and utility.
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This...
661