Related papers: Lattice complexity and fine graining of symbolic s…
There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…
Complex patterns generated by the time evolution of a one-dimensional digitalized coupled map lattice are quantitatively analyzed. A method for discerning complexity among the different patterns is implemented. The quantitative results…
The knowledge of transitions between regular, laminar or chaotic behavior is essential to understand the underlying mechanisms behind complex systems. While several linear approaches are often insufficient to describe such processes, there…
The sequences, given by a 7D map have been analysed by means of the methods, widely used to detect chaos in the real world in order to test their sensitivity to chaotic features of a non-linear system determined by comparatively high number…
A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexity. This physical complexity can be estimated for ensembles…
In this paper we examine the concept of complexity as it applies to generative art and design. Complexity has many different, discipline specific definitions, such as complexity in physical systems (entropy), algorithmic measures of…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
The complex Langevin approach is a promising method for the numerical treatment of systems with a sign problem, for which conventional lattice field theory techniques based on importance sampling cannot be applied. However, complex Langevin…
The nature of concept learning is a core question in cognitive science. Theories must account for the relative difficulty of acquiring different concepts by supervised learners. For a canonical set of six category types, two distinct…
Whether a system is to be considered complex or not depends on how one searches for correlations. We propose a general scheme for calculation of entropies in lattice systems that has high flexibility in how correlations are successively…
In recent studies, new measures of complexity for nonlinear systems have been proposed based on probabilistic grounds, as the LMC measure (Phys. Lett. A {\bf 209} (1995) 321) or the SDL measure (Phys. Rev. E {\bf 59} (1999) 2). All these…
The dynamics of an extended, spatiotemporally chaotic system might appear extremely complex. Nevertheless, the local dynamics, observed through a finite spatiotemporal window, can often be thought of as a visitation sequence of a finite…
Lattice field theories with a complex action can be studied numerically by allowing a complexified configuration space to be explored. Here we compare the recently introduced formulation on a Lefschetz thimble with the result from…
Complexity is an important metric for appropriate characterization of different classes of irregular signals, observed in the laboratory or in nature. The literature is already rich in the description of such measures using a variety of…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
We use an extension of fundamental measure theory to lattice hard-core fluids to study the phase diagram of two different systems. First, two-dimensional parallel hard squares with edge-length $\sigma=2$ in a simple square lattice. This…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
We review possible measures of complexity which might in particular be applicable to situations where the complexity seems to arise spontaneously. We point out that not all of them correspond to the intuitive (or "naive") notion, and that…