Pinning control of networks: dimensionality reduction through simultaneous block-diagonalization of matrices
In this paper, we study the network pinning control problem in the presence of two different types of coupling: (i) node-to-node coupling among the network nodes and (ii) input-to-node coupling from the source node to the `pinned nodes'. Previous work has mainly focused on the case that (i) and (ii) are of the same type. We decouple the stability analysis of the target synchronous solution into subproblems of the lowest dimension by using the techniques of simultaneous block diagonalization (SBD) of matrices. Interestingly, we obtain two different types of blocks, driven and undriven. The overall dimension of the driven blocks is equal to the dimension of an appropriately defined controllable subspace, while all the remaining undriven blocks are scalar. Our main result is a decomposition of the stability problem into four independent sets of equations, which we call quotient controllable, quotient uncontrollable, redundant controllable, and redundant uncontrollable. Our analysis shows that the number and location of the pinned nodes affect the number and the dimension of each set of equations. We also observe that in a large variety of complex networks, stability of the target synchronous solution is de facto only determined by a single quotient controllable block.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionSimilar Papers 제목 키워드 기반
Interpolating between Clustering and Dimensionality Reduction with Gromov-Wasserstein
We present a versatile adaptation of existing dimensionality reduction (DR) objectives, enabling the simultaneous reduction of both sample and feature sizes. Correspondances between input and embedding samples are comput…
ClusteringDimensionality ReductionSimultaneous Dimensionality Reduction for Extracting Useful Representations of Large Empirical Multimodal Datasets
The quest for simplification in physics drives the exploration of concise mathematical representations for complex systems. This Dissertation focuses on the concept of dimensionality reduction as a means to obtain low-di…
Dimensionality ReductionNeurAM: nonlinear dimensionality reduction for uncertainty quantification through neural active manifolds
We present a new approach for nonlinear dimensionality reduction, specifically designed for computationally expensive mathematical models. We leverage autoencoders to discover a one-dimensional neural active manifold (Ne…
Dimensionality ReductionUncertainty QuantificationGiDR-DUN; Gradient Dimensionality Reduction -- Differences and Unification
TSNE and UMAP are two of the most popular dimensionality reduction algorithms due to their speed and interpretable low-dimensional embeddings. However, while attempts have been made to improve on TSNE's computational com…
Dimensionality ReductionData efficiency, dimensionality reduction, and the generalized symmetric information bottleneck
The Symmetric Information Bottleneck (SIB), an extension of the more familiar Information Bottleneck, is a dimensionality reduction technique that simultaneously compresses two random variables to preserve information be…
Dimensionality Reduction