Related papers: On $n$-tuplewise IP-sensitivity and thick sensitiv…
We present an approach for the detection of sharp change points (short-lived and persistent) in nonlinear and nonstationary dynamic systems under high levels of noise by tracking the local phase and amplitude synchronization among the…
Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…
In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…
For general asymptotically sub-additive potentials (resp. asymptotically additive potentials) on general topological dynamical systems, we establish some variational relations between the topological entropy of the level sets of Lyapunov…
This paper introduces a novel direct approach to system identification of dynamic networks with missing data based on maximum likelihood estimation. Dynamic networks generally present a singular probability density function, which poses a…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
Composite systems are large complex systems con- sisting of interconnected agents (subsystems). Agents in a com- posite system interact with each other towards performing an in- tended goal. Controllability is essential to achieve desired…
In this paper, we introduce and study the notions of $\Delta$-mixing, $\Delta$-transitivity, mildly mixing, strong multi-transitivity and multi-transitivity with respect to a vector in non-autonomous discrete dynamical systems (NDS).…
We present and analyze a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to "convert" a static network into a dynamic distributed hash table(DHT)-based P2P network such…
A one-dimensional interacting particle system is said to exhibit interface tightness if starting in an initial condition describing the interface between two constant configurations of different types, the process modulo translations is…
This paper concerns the consensus of discrete-time multi-agent systems with linear or linearized dynamics. An observer-type protocol based on the relative outputs of neighboring agents is proposed. The consensus of such a multi-agent system…
We show that a topological dynamical system is either minimal or have positive topological entropy. Moreover, for equicontinuous systems, we show that topological transitivity, minimality and orbit gluing property are equivalent. These…
We introduce the notion of W-measurable sensitivity, which extends and strictly implies canonical measurable sensitivity, a measure- theoretic version of sensitive dependence on initial conditions. This notion also implies pairwise…
We prove that if a topological dynamical system is mean sensitive and contains a mean proximal pair consisting of a transitive point and a periodic point, then it is mean Li-Yorke chaotic (DC2 chaotic). On the other hand we show that a…
This paper analyzes the stability of interconnected continuous-time (CT) and discrete-time (DT) systems coupled through sampling and zero-order hold mechanisms. The DT system updates its output at regular intervals $T>0$ by applying an…
In this article we setup a dynamic device-to-device communication system where devices, given as a Poisson point process, move in an environment, given by a street system of random planar-tessellation type, via a random-waypoint model.…
Dynamic networks are structured interconnections of dynamical systems (modules) driven by external excitation and disturbance signals. In order to identify their dynamical properties and/or their topology consistently from measured data, we…
We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous…
This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of…
In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…