Related papers: Deterministic and probabilistic algorithms for sta…
We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the framework is the algebraic concept of multinorm, which…
This paper proposes a novel method for designing finite-horizon discrete-valued switching signals in linear switched systems based on discreteness-promoting regularization. The inherent combinatorial optimization problem is reformulated as…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this…
Network systems have become a ubiquitous modeling tool in many areas of science where nodes in a graph represent distributed processes and edges between nodes represent a form of dynamic coupling. When a network topology is already known…
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
In this paper, we consider the asymptotic stability for a system of linear delay differential equations. By analysing of the characteristic equation in detail, we have established the necessary and sufficient condition for the asymptotic…
We consider the problem of deterministic load balancing of tokens in the discrete model. A set of $n$ processors is connected into a $d$-regular undirected network. In every time step, each processor exchanges some of its tokens with each…
We investigate the problem of stabilizing an unknown networked linear system under communication constraints and adversarial disturbances. We propose the first provably stabilizing algorithm for the problem. The algorithm uses a distributed…
Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…
In this paper, we study the probabilistic stability analysis of a subclass of stochastic hybrid systems, called the Planar Probabilistic Piecewise Constant Derivative Systems (Planar PPCD), where the continuous dynamics is deterministic,…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
If a linear switching system with frequent switches is stable, will it be stable under arbitrary switches? In general, the answer is negative. Nevertheless, this question can be answered in an explicit form for any concrete system. This is…
This paper proposes a general switching dynamical system model, and a custom majorization-minimization-based algorithm EM++ for identifying its parameters. For certain families of distributions, such as Gaussian distributions, this…
We propose and analyze a stabilizing iteration scheme for the algorithmic implementation of model predictive control for linear discrete-time systems. Polytopic input and state constraints are considered and handled by means of so-called…
The paper presents a new control algorithm for unstable linear systems with input delay. In comparison with known analogues, the control law has been designed, which is a modification of the Smith predictor, and is the simplest one to…
In this paper, we investigate random walk based token circulation in dynamic environments subject to failures. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits…
In this paper, we propose a new numerical strategy for the stabilization of evolution systems. The method is based on the methodology given by Ammari, Nicaise andPignotti in ''Stabilization by switching time-delay, Asymptot. Anal., 83…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…