Type-V intermittency from Markov binary block visibility graph perspective

DOI10.1016/J.PHYSA.2022.127443OpenAlexW4293254595MaRDI QIDQ2158081

Nayyere Nasiri, Pejman Bordbar, S. Ahadpour

Publication date: 22 July 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2022.127443

zbMATH Keywords

chaosbinary block designMarkov binary visibility graphtype-V intermittency

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• The robustness of resolvable block designs against the loss of whole blocks or replicates
• Markov-binary visibility graph: a new method for analyzing complex systems
• Efficiency of connected binary block designs when a single observation is unavailable
• An efficient procedure for the avoidance of disconnected incomplete block designs
• Type-II intermittency from Markov binary block visibility graph perspective
• Construction of neighbor balanced block designs
• An experimental observation of a new type of intermittency
• Block cipher design: Generalized single-use-algorithm based on chaos
• New Advances on Chaotic Intermittency and its Applications
• Incomplete Block Designs
• Finite Geometries and Combinatorial Designs
• The Structure and Function of Complex Networks
• New type of intermittency in discontinuous maps
• Type-I intermittency from Markov binary block visibility graph perspective

This page was built for publication: Type-V intermittency from Markov binary block visibility graph perspective