Related papers: Stabilization Bounds for Influence Propagation fro…
This paper addresses the problem of reaching consensus under input saturation and intermittent communication, which can hinder the convergence of the system. We propose a method that translates the consensus into an equivalent stability…
We perform network analysis of a system described by the master equation to estimate the lower bound of the steady-state current noise, starting from the level 2.5 large deviation function and using the graph theory approach. When the…
We extend the N-Intertwined Mean-Field Approximation (NIMFA) for the Susceptible-Infectious-Susceptible (SIS) epidemiological process to time-varying networks. Processes on time-varying networks are often analysed under the assumption that…
We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown…
The stability and transition in the bottom boundary layer under a solitary wave are analysed in the presence of finite amplitude disturbances. First, the receptivity of the boundary layer is investigated using a linear input-output…
A stochastic process, when subject to resetting to its initial condition at a constant rate, generically reaches a non-equilibrium steady state. We study analytically how the steady state is approached in time and find an unusual relaxation…
Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing, fake messages may be placed in communication links…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…
The boundary modified contact process models an epidemic spreading in one dimension with two infection parameters, $\lambda_i$ and $\lambda_e$. Starting from a finite infected set, each edge of $\mathbb{Z}$ transmits the infection at rate…
Stability of linear systems with uncertain bounded time-varying delays is studied under assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound…
In this work, we consider a finite-state inhomogeneous-time Markov chain whose probabilities of transition from one state to another tend to decrease over time. This can be seen as a cooling of the dynamics of an underlying Markov chain. We…
Asymptotic hyperstability is achievable under certain switching laws if at least one of the feed-forward parameterization: 1) possesses a strictly positive real transfer function, 2) a minimum residence time interval is respected for each…
This paper deals with the boundary stabilization problem of a one-dimensional wave equation with a switching time-delay in the boundary. We show that the problem is well-posed in the sense of semigroups theory of linear operators. Then, we…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
Multiplicity of phase states within frequency locked bands in periodically forced oscillatory systems may give rise to front structures separating states with different phases. A new front instability is found within bands where…
We investigate the phase transitions in a one-dimensional system with colored noise. Previous studies indicated that the phase diagram of this system included extended and disorder-induced localized phases. However, by studying the…
We consider a discrete-time voter model process on a set of nodes, each being in one of two states, either 0 or 1. In each time step, each node adopts the state of a randomly sampled neighbor according to sampling probabilities, referred to…
We consider a stable but nearly unstable autoregressive process of any order. The bridge between stability and instability is expressed by a time-varying companion matrix $A_{n}$ with spectral radius $\rho(A_{n}) < 1$ satisfying…
We introduce and analyze a discrete-time network process in which each node holds a (weak) preference ordering over a finite set of alternatives and updates by local Borda aggregation. At each step, a node forms a weighted average…