Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
From MaRDI portal
Publication:2407156
DOI10.1016/j.automatica.2017.01.009zbMath1370.93131OpenAlexW2528319639MaRDI QIDQ2407156
Publication date: 28 September 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/40948924/2017_Grounded_Laplacian_authors_copy.pdf
Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Eigenvalue problems (93B60) Large-scale systems (93A15)
Related Items
Schur reduction of trees and extremal entries of the Fiedler vector ⋮ Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition ⋮ Scale fragilities in localized consensus dynamics ⋮ A first hitting time approach to finding effective spreaders in a network ⋮ Equilibria and control of metabolic networks with enhancers and inhibitors ⋮ Continuous-time opinion dynamics on multiple interdependent topics ⋮ Observability-blocking control using sparser and regional feedback for network synchronization processes ⋮ Cluster consensus in first and second-order continuous-time networks with input and communication delays ⋮ Multi-consensus of second-order agents in discrete-time directed networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering in diffusively coupled networks
- Leader-following consensus of multi-agent systems under fixed and switching topologies
- On pinning synchronization of complex dynamical networks
- Synchronization in networks of identical linear systems
- Graph properties for splitting with grounded Laplacian matrices
- On the spectra of nonsymmetric Laplacian matrices
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Fast linear iterations for distributed averaging
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Matrix Analysis
- Shorter Notes: Convexity of the Dominant Eigenvalue of an Essentially Nonnegative Matrix
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity
- Opinion Fluctuations and Disagreement in Social Networks
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Structural Balance and Opinion Separation in Trust–Mistrust Social Networks
