Related papers: Persistence in Complex Systems
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
Robustness is key to engineering, automation, and science as a whole. However, the property of robustness is often underpinned by costly requirements such as over-provisioning, known uncertainty and predictive models, and known adversaries.…
Resilience is widely recognized as an important design goal though it is one that seems to escape a general and consensual understanding. Often mixed up with other system attributes; traditionally used with different meanings in as many…
Rising interest in the resilience of ecological systems has spawned diverse interpretations of the term's precise meaning. This paper classifies and explores definitions of resilience from the ecological literature using a dynamical systems…
Persistent Memory (PM) is non-volatile byte-addressable memory that offers read and write latencies in the order of magnitude smaller than flash storage, such as SSDs. This survey discusses how file systems address the most prominent…
Complex systems are characterized by specific time-dependent interactions among their many constituents. As a consequence they often manifest rich, non-trivial and unexpected behavior. Examples arise both in the physical and non-physical…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
Algorithmic robustness refers to the sustained performance of a computational system in the face of change in the nature of the environment in which that system operates or in the task that the system is meant to perform. Below, we motivate…
We study the persistence probability for some discrete-time, time-reversible processes. In particular, we deduce the persistence exponent in a number of examples: first, we deal with random walks in random sceneries (RWRS) in any dimension…
The concept of resilience embodies the quest towards the ability to sustain shocks, to suffer from these shocks as little as possible, for the shortest time possible, and to recover with the full functionalities that existed before the…
The replication mechanism resolves some challenges with big data such as data durability, data access, and fault tolerance. Yet, replication itself gives birth to another challenge known as the consistency in distributed systems.…
The paper deals with a class of cooperative functional differential equations (FDEs) with infinite delay, for which sufficient conditions for persistence and permanence are established. Here, the persistence refers to all solutions with…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
Our societies are increasingly dependent on services supplied by computers & their software. New technology only exacerbates this dependence by increasing the number, performance, and degree of autonomy and inter-connectivity of…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
We study the persistence in a class of continuous stochastic processes that are stationary only under integer shifts of time. We show that under certain conditions, the persistence of such a continuous process reduces to the persistence of…
Two properties of a dynamical system, rigidity and non-recurrence, are examined in detail. The ultimate aim is to characterize the sequences along which these properties do or do not occur for different classes of transformations. The main…
The concept of cross diffusion is applied to some biological systems. The conditions for persistence and Turing instability in the presence of cross diffusion are derived. Many examples including: predator-prey, epidemics (with and without…
The goal of community detection algorithms is to identify densely-connected units within large networks. An implicit assumption is that all the constituent nodes belong equally to their associated community. However, some nodes are more…
Complexity is an inherent attribute of any project. The purpose of defining and documenting complexity is to have an early warning tool allowing a project team to focus on certain areas and aspects of the project in order to prevent and…