scispace - formally typeset
Proceedings ArticleDOI

New spectral graph theoretic conditions for synchronization in directed complex networks

Reads0
Chats0
TLDR
Lower bounds for the coupling strengths of oscillators in directed networks to guarantee global synchronization are proposed and the novel idea of graph comparison from spectral graph theory is employed.
Abstract
This paper proposes lower bounds for the coupling strengths of oscillators in directed networks to guarantee global synchronization. The novel idea of graph comparison from spectral graph theory is employed so that the topological features of a given network can be fully utilized to simplify computations. For large networks that can be decomposed into a set of smaller strongly connected components, the comparison can be carried out at the local level as well.

read more

Citations
More filters
Journal ArticleDOI

Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory

TL;DR: Using spectral graph theory and especially its graph comparison techniques, new methodologies to allocate coupling strengths to guarantee global complete synchronization in complex networks are proposed.
Journal ArticleDOI

Synchronization in Directed Complex Networks Using Graph Comparison Tools

TL;DR: Lower bounds for the coupling strengths of oscillators in directed networks to guarantee global synchronization are proposed and examples are provided to demonstrate how to apply the proposed methodologies to typical directed complex networks.
Proceedings ArticleDOI

Consensus of edge dynamics on complex networks

TL;DR: By mapping the edge topology into a corresponding line graph, it is proved that consensus can be achieved among the states of all edges in a connected network.

Cooperative control in complex multi-agent networks facing information constraints

Hui Liu
TL;DR: In this article, the focus is on the cooperatief regelen of complexe multi-agentnetwerken with informatie restricties, such as gekwantificeerde informaties, onzekerheden in de dynamica van de agenten and lokale kennis van de topologie van het netwerk.
Proceedings ArticleDOI

Bipartite Consensus of Time-varying Multi-agent Systems with Signed Edge Dynamics

TL;DR: This work investigates the bipartite consensus problem for a time-varying multi-agent system with signed edge dynamics and proposes a distributed consensus protocol for this problem.
References
More filters
Book

Spectral Graph Theory

TL;DR: Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigen values and quasi-randomness
Proceedings ArticleDOI

Spectral Graph Theory and its Applications

TL;DR: This tutorial will try to provide some intuition as to why these eigenvectors and eigenvalues have combinatorial significance, and will sitn'ey some of their applications.
Journal ArticleDOI

Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach

TL;DR: Graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.
Journal ArticleDOI

Connection Graph Stability Method for Synchronized Coupled Chaotic Systems

TL;DR: This paper elucidates the relation between network dynamics and graph theory and proposes a new general method to determine global stability of total synchronization in networks with different topologies that combines the Lyapunov function approach with graph theoretical reasoning.
Book

Synchronization in Complex Networks of Nonlinear Dynamical Systems

Chai Wah Wu
TL;DR: Graphs, Networks, Laplacian Matrices and Algebraic Connectivity Graph Models Synchronization in Networks of Nonlinear Continuous-Time Dynamical Systems Synchronized in networks of Coupled Discrete-Time systems Synchronizing in Network of Systems with Linear Dynamics Agreement and Consensus Problems in Groups of Interacting Agents.
Related Papers (5)