Hubs-attracting Laplacian and Related Synchronization on Networks
DOI10.1137/19M1287663zbMath1439.05210OpenAlexW3023453391MaRDI QIDQ5109377
Ernesto Estrada, Lucia Valentina Gambuzza, Mattia Frasca
Publication date: 11 May 2020
Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1287663
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Synchronization of solutions to ordinary differential equations (34D06)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum performance at minimum cost in network synchronization
- Network synchronizability analysis: the theory of subgraphs and complementary graphs
- Laplacian matrices of graphs: A survey
- Random walks and diffusion on networks
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Complex networks: structure and dynamics
- Semigroup methods for evolution equations on networks
- Comparison of mean hitting times for a degree-biased random walk
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- Characterizing the Synchronizability of Small-World Dynamical Networks
- Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties
- Self-Organization of Weighted Networks for Optimal Synchronizability
- Network synchronizability analysis: A graph-theoretic approach
- Efficient rewirings for enhancing synchronizability of dynamical networks
- Complex Networks
This page was built for publication: Hubs-attracting Laplacian and Related Synchronization on Networks
