Related papers: Stabilization Time in Weighted Minority Processes
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of…
In this paper, we study the phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected…
We study the stability and synchronization of predator-prey populations subjected to noise. The system is described by patches of local populations coupled by migration and predation over a neighborhood. When a single patch is considered,…
We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case…
In this paper, we consider the stabilization of wave equations with moving boundary. First, we show the solution behaviour of wave equation with Neumann boundary conditions, that is, the energy of wave equation with mixed boundary…
We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flows to distribution schedules. In a temporal graph there is a…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
Stabilization of linear systems with unknown dynamics is a canonical problem in adaptive control. Since the lack of knowledge of system parameters can cause it to become destabilized, an adaptive stabilization procedure is needed prior to…
In our manuscript, we develop a new approach for stability analysis of one-dimensional wave equation with time delay. The major contribution of our work is to develop a new method for spectral analysis. We derive sufficient and necessary…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
This article deals with stability of continuous-time switched linear systems under constrained switching. Given a family of linear systems, possibly containing unstable dynamics, we characterize a new class of switching signals under which…
A solution to a given equation is structurally stable if it suffers only an infinitesimal change when the equation (not the solution) is perturbed infinitesimally. We have found that structural stability can be used as a velocity selection…
This paper is concerned with the behaviour of a L\'{e}vy process when it crosses over a positive level, $u$, starting from 0, both as $u$ becomes large and as $u$ becomes small. Our main focus is on the time, $\tau_u$, it takes the process…
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm --…
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…
Maintaining numerical stability in machine learning models is crucial for their reliability and performance. One approach to maintain stability of a network layer is to integrate the condition number of the weight matrix as a regularizing…
The accurate estimation of scaling exponents is central in the observational study of scale-invariant phenomena. Natural systems unavoidably provide observations over restricted intervals; consequently a stationary stochastic process (time…
A method is provided for approximating random slow manifolds of a class of slow-fast stochastic dynamical systems. Thus approximate, low dimensional, reduced slow systems are obtained analytically in the case of sufficiently large time…
In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness.…