Sequential motif profile of natural visibility graphs.

@article{Iacovacci2016SequentialMP,
  title={Sequential motif profile of natural visibility graphs.},
  author={Jacopo Iacovacci and Lucas Lacasa},
  journal={Physical review. E},
  year={2016},
  volume={94 5-1},
  pages={
          052309
        }
}
The concept of sequential visibility graph motifs-subgraphs appearing with characteristic frequencies in the visibility graphs associated to time series-has been advanced recently along with a theoretical framework to compute analytically the motif profiles associated to horizontal visibility graphs (HVGs). Here we develop a theory to compute the profile of sequential visibility graph motifs in the context of natural visibility graphs (VGs). This theory gives exact results for deterministic… 

Figures and Tables from this paper

Sequential limited penetrable visibility-graph motifs

The limited penetrable visibility-graph motif entropy and motif entropy are applied to mine the information about different flow patterns contained in the ultrasonic sensor signals of oil-in-water two-phase flow.

Visibility graphs and symbolic dynamics

Tetradic motif profiles of horizontal visibility graphs

Degree distributions and motif profiles of limited penetrable horizontal visibility graphs

Analysing the Dynamics of Interbeat Interval Time Series Using Grouped Horizontal Visibility Graph

The results show that the proposed GHVE measure is more accurate in distinguishing healthy and pathological subjects than its non-grouped counter-part HVG and is, therefore, better suited to detect changes in aging, disease severity, and activity levels.

N ov 2 01 8 Tetradic motif profiles of horizontal visibility graphs

Network motif analysis is a useful tool for the investigation of complex networks. We study the profiles of tetradic motifs in horizontal visibility graphs (HVGs) converted from multifractal binomial

Universal visibility patterns of unimodal maps.

The horizontal visibility is applied to study the class of unimodal maps that give rise to equivalent bifurcation diagrams and an infinite pattern of visibility appears, containing all visibility patterns of the periodic time series of the cascade.

Visibility Graphs for Image Processing

  • J. IacovacciL. Lacasa
  • Computer Science
    IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2020
It is demonstrated that the link architecture of the image visibility graphs encapsulates relevant information on the structure of the images and it is explored their potential as image filters.

References

SHOWING 1-10 OF 31 REFERENCES

Sequential visibility-graph motifs.

This work develops a theory to compute in an exact way the motif profiles associated with general classes of deterministic and stochastic dynamics, and finds that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing among different dynamics and robust against noise contamination.

On the degree distribution of horizontal visibility graphs associated with Markov processes and dynamical systems: diagrammatic and variational approaches

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal

Analytical properties of horizontal visibility graphs in the Feigenbaum scenario.

An in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree distributions, mean distances, clustering coefficients, etc., associated to the bifurcation cascades and their accumulation points and how the resultant families of graphs can be framed into a renormalization group scheme in which fixed-point graphs reveal their scaling properties.

Horizontal Visibility graphs generated by type-II intermittency

A phenomenological theory is derived that predicts quantitative values for several network parameters based on the trajectories generated by unimodal maps close to an inverse tangent bifurcation and how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure.

Directed Network Representation of Discrete Dynamical Maps

A network representation of dynamical maps (such as the logistic map) on the unit interval is suggested and it is numerically demonstrated that these network characteristics seem to diverge at the first zeros of the Lyapunov exponent and could thus provide an alternative measure to detect the 'edge of chaos' in dynamical systems.

The geometry of chaotic dynamics — a complex network perspective

This paper demonstrates that the well known graph theoretical properties local clustering coefficient and global (network) transitivity can meaningfully be exploited to define two new local and two new global measures of dimension in phase space: local upper and lower clustering dimension as well as global higher and lower transitivity dimension.

Recurrence networks—a novel paradigm for nonlinear time series analysis

It has been demonstrated here that there are fundamental relationships between many topological properties of recurrence networks and different nontrivial statistical properties of the phase space density of the underlying dynamical system.

Superfamily phenomena and motifs of networks induced from time series

A transformation from time series to complex networks is introduced and the relative frequency of different subgraphs within that network is studied to characterize different types of continuous dynamics: periodic, chaotic, and periodic with noise.

Permutation Complexity in Dynamical Systems: Ordinal Patterns, Permutation Entropy and All That

The study of permutation complexity can be envisioned as a new kind of symbolic dynamics whose basic blocks are ordinal patterns, that is, permutations defined by the order relations among points in