Determining efficiency of small-world algorithms: a comparative approach

DOI10.1016/J.MATCOM.2021.03.028OpenAlexW3148636071MaRDI QIDQ2664774

Cornelio Posadas-Castillo, Eliezer Garza-González, Allan G. S. Sánchez

Publication date: 18 November 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2021.03.028

zbMATH Keywords

chaotic synchronizationcomplex networkmulti-scroll chaotic oscillatorsmall-world property

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Coupling strength computation for chaotic synchronization of complex networks with multi-scroll attractors
• Generalized connection graph method for synchronization in asymmetrical networks
• Renormalization group analysis of the small-world network model
• On the chaos synchronization phenomena
• Smart pattern to generate small-world networks
• Leader-following consensus of linear time-varying multi-agent systems under fixed and switching topologies
• Global dynamics of an epidemic model with incomplete recovery in a complex network
• Rumor model on homogeneous social network incorporating delay in expert intervention and government action
• Neural sliding-mode pinning control for output synchronization for uncertain general complex networks
• On the maximum small-world subgraph problem
• Probability Theory
• Cellular Neural Networks, Multi-Scroll Chaos and Synchronization
• COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
• Pinning synchronization of complex delayed dynamical networks via generalized intermittent adaptive control strategy
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Determining efficiency of small-world algorithms: a comparative approach