Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2011-12-30
Physics
Condensed Matter
Disordered Systems and Neural Networks
11 pages, 5 EPS figures
Scientific paper
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\H{o}s-R\'enyi 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.
Lacasa Lucas
Severini Simone
Teschendorff Andrew
West James
No associations
LandOfFree
Approximate entropy of network parameters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate entropy of network parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate entropy of network parameters will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-334654