Type-I intermittency from Markov binary block visibility graph perspective
From MaRDI portal
Publication:5861585
DOI10.1080/02664763.2020.1761949OpenAlexW3025757641MaRDI QIDQ5861585
Publication date: 1 March 2022
Published in: Journal of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02664763.2020.1761949
Related Items (1)
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
- Degree distributions and motif profiles of limited penetrable horizontal visibility graphs
- Tetradic motif profiles of horizontal visibility graphs
- 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
- From time series to complex networks: The visibility graph
- Incomplete Block Designs
- Finite Geometries and Combinatorial Designs
- New type of intermittency in discontinuous maps
This page was built for publication: Type-I intermittency from Markov binary block visibility graph perspective