Quasiperiodic graphs: structural design, scaling and entropic properties

Abstract

A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.

References in corpus (2)

• From time series to complex networks: the visibility graph
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario

Cited by in corpus (16)

• Complex network approaches to nonlinear time series analysis
• Network structure of multivariate time series
• Visibility graphs for image processing
• Time reversibility from visibility graphs of non-stationary processes
• Horizontal Visibility graphs generated by type-I intermittency
• On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches
• Sequential motif profile of natural visibility graphs
• Visibility graphs and symbolic dynamics
• Visibility graphs of random scalar fields and spatial data
• Canonical Horizontal Visibility Graphs are uniquely determined by their degree sequence
• Generalized Statistical Mechanics at the Onset of Chaos
• Horizontal Visibility graphs generated by type-II intermittency
• Quasiperiodic graphs at the onset of chaos
• Manifestations of the onset of chaos in condensed matter and complex systems
• Haros graphs: an exotic representation of real numbers
• Chaotic renormalization group flow and entropy gradients over Haros graphs