Related papers: Synchronizing delay for binary uniform morphisms
We consider characterisations of unitary dilations and approximations of irreversible classical dynamical systems on a Hilbert space. In the commutative case, building on the work in [9], one can express well known approximants (e.g. Hille-…
Time-delay systems are an important class of dynamical systems which provide a solid mathematical framework to deal with many application domains of interest ranging from biology, chemical, electrical, and mechanical engineering, to…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
In this paper, the transition of synchronizing path of delay-coupled chaotic oscillators in a scale-free network is highlighted. Mainly, through the critical transmission delay makes chaotic oscillators be coupled on the edge of stability,…
We study the completely synchronized states (CSSs) of a system of coupled logistic maps as a function of three parameters: interaction strength ($\varepsilon$), range of the interaction ($\alpha$), that can vary from first-neighbors to…
Linear stability of synchronized states in networks of delay-coupled oscillators depends on the type of interaction, the network and oscillator properties. For inert oscillator response, found ubiquitously from biology to engineering,…
Systems with time delay play an important role in modeling of many physical and biological processes. In this paper we describe generic properties of systems with time delay, which are related to the appearance and stability of periodic…
This paper addresses the qualitative theory of mixed-order positive linear coupled systems with bounded or unbounded delays. First, we introduce a general result on the existence and uniqueness of solutions to mixed-order linear coupled…
We consider two transceivers, the first with perfect clock and the second with imperfect clock. We investigate the joint estimation of the delay between the transceivers and the offset and the drift of the imperfect clock. We propose a…
Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…
This paper concerns some spectral properties of the scalar dynamical system defined by a linear delay-differential equation with two positive delays. More precisely, the existing links between the delays and the maximal multiplicity of the…
Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph…
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On…
We define the delays of a circuit, as well as the properties of determinism, order, time invariance, constancy, symmetry and the serial connection.
We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular…
A condition for the synchronizability of a pair of PDE systems, coupled through a finite set of variables, is commonly the existence of internal synchronization or internal coherence in each system separately. The condition was previously…
Symbol synchronization refers to the estimation of the start of a symbol interval and is needed for reliable detection. In this paper, we develop a symbol synchronization framework for molecular communication (MC) systems where we consider…
Enumerating matchings is a classical problem in the field of enumeration algorithms. There are polynomial-delay enumeration algorithms for several settings, such as enumerating perfect matchings, maximal matchings, and (weighted) matchings…
Optimization is finding the best solution, which mathematically amounts to locating the global minimum of some cost function. Optimization is traditionally automated with digital or quantum computers, each having their limitations and none…
We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of…