Related papers: Stabilization Bounds for Influence Propagation fro…
We investigate a family of multiple-stable processes that may exhibit either long-range or short-range dependence, depending on the parameters. There are two parameters for the processes, the memory parameter $\beta\in(0,1)$ and the…
In this paper, we study the problem of stabilizing switched linear systems when only limited information about the state and the mode of the system is available, which occurs in many applications involving networked switched systems (such…
We present a loosely-stabilizing phase clock for population protocols. In the population model we are given a system of $n$ identical agents which interact in a sequence of randomly chosen pairs. Our phase clock is leaderless and it…
Direct numerical simulations are conducted to study the receptivity and transition mechanisms in a solitary wave boundary layer developing over randomly organized wave-like bottom topography. The boundary layer flow shows a selective…
Reasonably large perturbations may push a power grid from its stable synchronous state into an undesirable state. Identifying vulnerabilities in power grids by studying power grid stability against such perturbations can aid in preventing…
We study the evolution of majority dynamics with more than two states on the binomial random graph $G(n,p)$. In this process, each vertex has a state in $\{1,\ldots, k\}$, with $k\geq 3$, and at each round every vertex adopts state $i$ if…
A notion of disturbance propagation stability is defined for dynamical network processes, in terms of decrescence of an input-output energy metric along cutsets away from the disturbance source. A characterization of the disturbance…
Some sufficient conditions on the algebraic stability of non-homogeneous regime-switching diffusion processes are established. In this work we focus on determining the decay rate of a stochastic system which switches randomly between…
Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
Typically, contagion strength is modeled by a transmission rate $\lambda$, whereby all nodes in a network are treated uniformly in a mean-field approximation. However, local agents react differently to the same contagion based on their…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time.…
In this work, we analyze the circumstances under which social influence operations are likely to succeed. These circumstances include the selection of Confederate agents to execute intentional perturbations and the selection of Perturbation…
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
It is known that state-dependent, multi-step Lyapunov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the "fluid model" approach to stability of…
We consider finite configurations of particles and holes sampled according to Bernoulli product measure and with a second class particle added to a random position. The stabilization time is the number of steps needed to reach an ordered…
We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…
We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/opinions on the basis of information collected from their…
We consider control systems of the type $\dot x = A x +\alpha(t)bu$, where $u\in\R$, $(A,b)$ is a controllable pair and $\alpha$ is an unknown time-varying signal with values in $[0,1]$ satisfying a persistent excitation condition i.e.,…
This article is concerned with stability analysis and stabilization of randomly switched systems under a class of switching signals. The switching signal is modeled as a jump stochastic (not necessarily Markovian) process independent of the…