Reconstruction of dynamic networks with time-delayed interactions in the presence of fast-varying noises

Zhaoyang Zhang1,2, Yang Chen3, Yuanyuan Mi4

  • 1Department of Physics, School of Physical Science and Technology, Ningbo University, Ningbo, Zhejiang 315211, China.

Physical Review. E
|May 22, 2019
PubMed

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.5K
Protein Networks02:26

Protein Networks

2.8K
Gradually Varying Flow01:29

Gradually Varying Flow

Gradually varying flow (GVF) in open channels describes situations where water depth changes slowly along the channel due to factors like non-uniform bed slope, channel shape variations, or obstructions. This flow type occurs when the depth adjusts gradually to balance gravitational forces, shear forces, and energy requirements, resulting in a low rate of depth change.Characteristics of Gradually Varying FlowGVF is commonly observed in natural streams, rivers, and canals, where flow depth...
428
Rapidly Varying Flow01:24

Rapidly Varying Flow

Rapidly varying flow (RVF) in open channels is characterized by abrupt changes in flow depth over a short distance, with the rate of depth change relative to distance often approaching unity. These flows are inherently complex due to their transient and multi-dimensional nature, making exact analysis difficult. However, approximate solutions using simplified models provide valuable insights into their behavior.Key Features of Rapidly Varying FlowRVF is commonly observed in scenarios involving...
466
Network Covalent Solids02:18

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...
16.1K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
930