Related papers: Synchronizing weighted automata
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very…
This paper investigates equilibrium points and stability in two synchronous machine configurations: (i) a single generator with an impedance load and (ii) two interconnected machines with co-located loads. We consider both abc and dq…
One of the most important problems in the field of distributed optimization is the problem of minimizing a sum of local convex objective functions over a networked system. Most of the existing work in this area focus on developing…
For a product of i.i.d. random maps or a memoryless stochastic flow on a compact space $X$, we find conditions under which the presence of locally asymptotically stable trajectories (e.g. as given by negative Lyapunov exponents) implies…
Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion…
We study a synchronization mechanism, based on one-way coupling of all-or-nothing type, applied to coupled map lattices with several different local rules. By analyzing the metric and the topological distance between the two systems, we…
Two replicas of spatially extended chaotic systems synchronize to a common spatio-temporal chaotic state when coupled above a critical strength. As a prototype of each single spatio-temporal chaotic system a lattice of maps interacting via…
In the multi-agent systems setting, this paper addresses continuous-time distributed synchronization of columns of rotation matrices. More precisely, k specific columns shall be synchronized and only the corresponding k columns of the…
There are three key factors of a system of coupled oscillators that characterize the interaction among them: coupling (how to affect), delay (when to affect) and topology (whom to affect). For each of them, the existing work has mainly…
Synchronization is a major concept in nonlinear physics. In a large number of systems, it is observed at long times for a sinusoidal excitation. In this paper, we design a transiently non-sinusoidal driving to reach the synchronization…
For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be…
We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in an arbitrary network. Using the known exact threshold value from the theory of differential equations with delays, we provide the…
We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…
We show that the synchronized states of two systems of identical chaotic maps subject to either, a common drive that acts with a probability p in time or to the same drive acting on a fraction p of the maps, are similar. The synchronization…
We investigate the synchronization dynamics in a chain of coupled chaotic maps organized in a single-parent family tree, whose properties can be captured considering each parent node connected to two children, one of which also serves as…
In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…
We show that the threshold of complete synchronization in a lattice of coupled non-smooth chaotic maps is determined by linear stability along the directions transversal to the synchronization subspace. We examine carefully the…
We investigate the spatiotemporal dynamics of a network of coupled chaotic maps, with varying degrees of randomness in coupling connections. While strictly nearest neighbour coupling never allows spatiotemporal synchronization in our…