Design of highly synchronizable and robust networks
From MaRDI portal
Recommendations
- Graphs (networks) with golden spectral ratio
- Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design
- Construction principles for highly synchronizable sparse directed networks
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Dynamical networks
Cites work
- scientific article; zbMATH DE number 3330693 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Adaptive Synchronization of an Uncertain Complex Dynamical Network
- Characterizing the Synchronizability of Small-World Dynamical Networks
- Collective dynamics of `small-world' networks
- Criteria for global pinning-controllability of complex networks
- Dynamics and stability in optical communication networks: a system theory framework
- Eigenvalues, diameter, and mean distance in graphs
- Emergence of Scaling in Random Networks
- Expander graphs and their applications
- Graphs (networks) with golden spectral ratio
- Isoperimetric numbers of graphs
- Kronecker graphs: an approach to modeling networks
- On pinning synchronization of complex dynamical networks
- On the chromatic number of graphs
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Pinning adaptive synchronization of a general complex dynamical network
- Ramanujan graphs
- Reaching a consensus via pinning control
- Regular graphs with four eigenvalues
- Synchronizability of complex networks
- Synchronization in an array of linearly coupled dynamical systems
- Synchronization in scale-free dynamical networks: robustness and fragility
- Synchronization in uncertain complex networks
- Synchronization of coupled harmonic oscillators in a dynamic proximity network
- Synchronization of coupled harmonic oscillators with local interaction
- The Structure and Function of Complex Networks
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search: Principles and applications
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(7)- Networks that optimize a trade-off between efficiency and dynamical resilience
- Organisational hierarchy constructions with easy Kuramoto synchronisation
- Optimized network structure for full-synchronization
- Sparse network optimization for synchronization
- Graphs (networks) with golden spectral ratio
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Reduced synchronizability of dynamical scale-free networks with onion-like topologies
This page was built for publication: Design of highly synchronizable and robust networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620598)
