Pages that link to "Item:Q5358404"
From MaRDI portal
The following pages link to Controllability Metrics, Limitations and Algorithms for Complex Networks (Q5358404):
Displaying 50 items.
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Goal-oriented state control of a cognitive linear model with a bounded state space (Q278902) (← links)
- Eigenvalue clustering, control energy, and logarithmic capacity (Q325057) (← links)
- Controller architectures: tradeoffs between performance and structure (Q328177) (← links)
- Pinning control for synchronization of nonlinear complex dynamical network with suboptimal SDRE controllers (Q331293) (← links)
- On quantitatively measuring controllability of complex networks (Q1620604) (← links)
- Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem (Q1640253) (← links)
- Decentralized state estimation for the control of network systems (Q1717463) (← links)
- Target control and source estimation metrics for dynamical networks (Q1737672) (← links)
- Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms (Q1737769) (← links)
- Minimal inputs/outputs for subsystems in a networked system (Q1797102) (← links)
- Regularity/controllability/observability of an NDS with descriptor form subsystems and generalized LFTs (Q2003793) (← links)
- Structural controllability of networked relative coupling systems (Q2021293) (← links)
- Benchmarking measures of network controllability on canonical graph models (Q2022716) (← links)
- The impact of graph symmetry on the number of driver nodes in complex networks (Q2027437) (← links)
- Resource-aware time-optimal control with multiple sparsity measures (Q2059349) (← links)
- Optimizing network topology for average controllability (Q2059509) (← links)
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing (Q2097717) (← links)
- Observability-blocking control using sparser and regional feedback for network synchronization processes (Q2097741) (← links)
- Partial strong structural controllability (Q2139435) (← links)
- On the control of psychological networks (Q2141650) (← links)
- Key node selection in minimum-cost control of complex networks (Q2146809) (← links)
- Closed-loop control of nonlinear neural networks: the estimate of control time and energy cost (Q2185602) (← links)
- A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds (Q2207184) (← links)
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes (Q2242949) (← links)
- Measure of quality of finite-dimensional linear systems: a frame-theoretic view (Q2243008) (← links)
- Distributed decision-making algorithms with multiple manipulative actors (Q2280848) (← links)
- Controllability of Kronecker product networks (Q2280986) (← links)
- Controllability-Gramian submatrices for a network consensus model (Q2303949) (← links)
- On almost controllability of dynamical complex networks with noises (Q2320625) (← links)
- Robust controllability assessment and optimal actuator placement in dynamic networks (Q2338199) (← links)
- On the fixed controllable subspace in linear structured systems (Q2407901) (← links)
- Bispectral analysis for measuring energy-orientation tradeoffs in the control of linear systems (Q2407905) (← links)
- The robust minimal controllability problem (Q2409157) (← links)
- Multi-competitive viruses over time-varying networks with mutations and human awareness (Q2662294) (← links)
- A randomized approach to sensor placement with observability assurance (Q2662304) (← links)
- On a Conjecture of Godsil Concerning Controllable Random Graphs (Q2953321) (← links)
- Key‐nodes selection problem for minimum cost control of directed networks (Q4563346) (← links)
- Particle filtering of dynamical networks: Highlighting observability issues (Q4631841) (← links)
- Optimal dictionary for least squares representation (Q4637030) (← links)
- Controllability of Network Opinion in Erdös--Rényi Graphs Using Sparse Control Inputs (Q5000624) (← links)
- Optimal control of complex networks with conformity behavior (Q5032060) (← links)
- Controlling consensus in networks with symmetries (Q5056535) (← links)
- Input matrix construction and approximation using a graphic approach (Q5134304) (← links)
- Discovering the topology of complex networks via adaptive estimators (Q5197570) (← links)
- Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization (Q5218141) (← links)
- Kron Reduction and Effective Resistance of Directed Graphs (Q5885814) (← links)
- Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective (Q6061327) (← links)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
- On polynomially solvable constrained input selections for fixed and switched linear structured systems (Q6088368) (← links)
