Related papers: Measures of $\e$-complexity
Iterated quadratic polynomials give rise to a rich collection of different dynamical systems that are parametrized by a simple complex parameter $c$. The different dynamical features are encoded by the \emph{kneading sequence} which is an…
We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized…
Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…
The concept of 'complexity' plays a central role in complex network science. Traditionally, this term has been taken to express heterogeneity of the node degrees of a therefore complex network. However, given that the degree distribution is…
Thanks to the increasing availability in computing power, high-dimensional engineering problems seem to be at reach. But the curse of dimensionality will always prevent us to try out extensively all the hypotheses. There is a vast…
On account of a greater need for understanding the complexity of time series like physiological time series, financial time series, and many more that enter into picture for their inculpation with real-world problems, several complexity…
We present two sets of computable entanglement measures for multipartite systems where each subsystem can have different degrees of freedom (so-called qudits). One set, called 'separability' measure, reveals which of the subsystems are…
We introduce a new complexity measure of a path of (problems, solutions) pairs in terms of the length of the path in the condition metric which we define in the article. The measure gives an upper bound for the number of Newton steps…
We critique the measure of complexity introduced by Shiner, Davison, and Landsberg in Ref. [1]. In particular, we point out that it is over-universal, in the sense that it has the same dependence on disorder for structurally distinct…
Concepts such as energy dependence, random deployment, dynamic topological update, self-organization, varying large number of nodes are among many factors that make WSNs a type of complex system. However, when analyzing WSNs properties…
In this chapter, a statistical measure of complexity and the Fisher-Shannon information product are introduced and their properties are discussed. These measures are based on the interplay between the Shannon information, or a function of…
We study dynamical systems which have bounded complexity with respect to three kinds metrics: the Bowen metric $d_n$, the max-mean metric $\hat{d}_n$ and the mean metric $\bar{d}_n$, both in topological dynamics and ergodic theory. It is…
The paper treats density measures as typical examples of finitely additive measures in $\mathbb{R}^n$. We study their structure and derive basic properties. In addition, estimates for related integrals are provided. The results are applied…
Introduction to the theory of decoherence. Contents: 1. The phenomenon of decoherence: superpositions, superselection rules, decoherence by "measurements". 2. Observables as a derivable concept. 3. The measurement problem. 4. Density…
We introduce a quantitative measure of network bipartivity as a proportion of even to total number of closed walks in the network. Spectral graph theory is used to quantify how close to bipartite a network is and the extent to which…
We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all…
Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to…
One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…
Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. In this paper, we focus on a particular sense of complexity that is high if the data is structured in a way…