Approximate entropy of network parameters
arXiv:1201.0045 · doi:10.1103/PhysRevE.85.046111
Abstract
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural entropy obtained by computing the approximate entropy of the so called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdős-Rényi networks. By using classical results of Pincus, we show that our entropy measure converges with network size to a certain binary Shannon entropy. On a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs permit to naturally associate to a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches.
arXiv comment11 pages, 5 EPS figures
References in corpus (17)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Epidemic spreading in scale-free networks
- From time series to complex networks: the visibility graph
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- The Visibility Graph: a new method for estimating the Hurst exponent of fractional Brownian motion
- Entangled networks, synchronization, and optimal network topology
- The entropy of network ensembles
- Description of stochastic and chaotic series using visibility graphs
- The entropy of randomized network ensembles
- Assessing the relevance of node features for network structure
- Entropy Rate of Diffusion Processes on Complex Networks
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- The entropic origin of disassortativity in complex networks
- Feigenbaum graphs: a complex network perspective of chaos
- A characterization of horizontal visibility graphs and combinatorics on words
- Control by quantum dynamics on graphs