Abstract
Complexity analysis of fractional-order chaotic systems is an interesting topic of recent years. In this paper, the fractional symbolic network entropy measure algorithm is designed in which the symbol networks are built and fractional generalized information is introduced. Complexity of the fractional-order chaotic systems is analyzed. It shows that the proposed algorithm is effective for measure complexity of different pseudo random sequences. Complexity decreases with the decrease of derivative order in the fractional-order discrete chaotic system while changes with the derivative order in the fractional-order continuous chaotic system. Moreover, basin of attraction is also determined by the derivative order. It provides a basis for parameter choice of the fractional-order chaotic systems in the real applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
