Related papers: Deterministic concurrent systems
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
This paper introduces indefinite proximities inherent in the collection of physical objects found in a dynamical system. Axiomatically, these indefinite proximities lead to a new form of Hausdorff topology, which is indefinite…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
We demonstrate the advantages of randomization in coherent quantum dynamical control. For systems which are either time-varying or require decoupling cycles involving a large number of operations, we find that simple randomized protocols…
In this note, we propose a novel approach for a class of autonomous dynamical systems that allows, given some observations of the solutions, to identify its parameters and reconstruct the state vector. This approach relies on proving the…
Scaling probabilistic models to large realistic problems and datasets is a key challenge in machine learning. Central to this effort is the development of tractable probabilistic models (TPMs): models whose structure guarantees efficient…
We prove some properties of analytic multiplicative and sub-multiplicative cocycles. The results allow to construct natural invariant analytic sets associated to complex dynamical systems.
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
The paper introduces and studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. A generalization of Perron Frobenius theory is developed in this differential framework to…
Differentiable programming is the combination of classical neural networks modules with algorithmic ones in an end-to-end differentiable model. These new models, that use automatic differentiation to calculate gradients, have new learning…
We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and…
To provide robustness of distributed model predictive control (DMPC), this work proposes a robust DMPC formulation for discrete-time linear systems subject to unknown-but-bounded disturbances. Taking advantage of the structure of certain…
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…
This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed…
A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of…
Stochastic differential equations describe well many physical, biological and sociological systems, despite the simplification often made in their derivation. Here the usage of simple stochastic differential equations to characterize and…
We study the dynamics of discrete-time regulatory networks on random digraphs. For this we define ensembles of deterministic orbits of random regulatory networks, and introduce some statistical indicators related to the long-term dynamics…
We give a simple algebraic derivation of a useful determinantal identity for multilevel systems such as random matrix chains and finite determinantal point processes, with applications to the calculation of point correlators, gap…
We attempt to make superdeterminism more intuitive, notably by simulating a deterministic model system, a billiard game. In this system an initial 'bang' correlates all events, just as in the superdeterministic universe. We introduce the…