Related papers: Chain recurrence rates and topological entropy
We show that a uniformly continuous random perturbation of a transitive map defines an aperiodic Harris chain which also satisfies Doeblin's condition. As a result, we get exponential decay of correlations for suitable random perturbations…
Nature is full of random networks of complex topology describing such apparently disparate systems as biological, economical or informatical ones. Their most characteristic feature is the apparent scale-free character of interconnections…
Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…
Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order. In particular we caracterize the maps corresponding to stochastic…
This paper proposes that common measures for network transitivity, based on the enumeration of transitive triples, do not reflect the theoretical statements about transitivity they aim to describe. These statements are often formulated as…
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the…
Topological entropy is a widely studied indicator of chaos in topological dynamics. Here we give a generalized definition of topological entropy which may be applied to set-valued functions. We demonstrate that some of the well-known…
We introduce distance entropy as a measure of homogeneity in the distribution of path lengths between a given node and its neighbours in a complex network. Distance entropy defines a new centrality measure whose properties are investigated…
We propose a method to search for signs of causal structure in spatiotemporal data making minimal a priori assumptions about the underlying dynamics. To this end, we generalize the elementary concept of recurrence for a point process in…
Spiking activity from populations of neurons display causal interactions and memory effects. Therefore, they are expected to show some degree of irreversibility in time. Motivated by the spike train statistics, in this paper we build a…
We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent…
This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…
We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…
Measuring the topological overlap of two graphs becomes important when assessing the changes between temporally adjacent graphs in a time-evolving network. Current methods depend on the fraction of nodes that have persisting edges. This…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
Observing how long a dynamical system takes to return to some state is one of the most simple ways to model and quantify its dynamics from data series. This work proposes two formulas to estimate the KS entropy and a lower bound of it, a…
In this paper, we will study the statistical behaviors of orbits. Firstly, we will show that for a dynamical systems have the shadowing property or almost specification property, the set of nonrecurrent points has full topological entropy.…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…