Related papers: Stabilization Time in Weighted Minority Processes
We consider financial networks, where banks are connected by contracts such as debts or credit default swaps. We study the clearing problem in these systems: we want to know which banks end up in a default, and what portion of their…
Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily…
We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to a large body…
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…
This paper is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and…
We consider a type of evolution on {0,1}^n which occurs in discrete steps whereby at each step, we replace every occurrence of the substring "01" by "10". After at most n-1 steps we will reach a string of the form 11..1100..11, which we…
We study the limit of the joint distribution of a multidimensional Generalized Tempered Stable (GTS) process and its quadratic covariation process when the stable index tends to two. Under a proper scaling, the GTS processes converges to a…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits…
The topic of this manuscript is the stability analysis of continuous-time switched nonlinear systems with constraints on the admissible switching signals. Our particular focus lies in considering signals characterized by upper and lower…
We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study…
We present exact results, as well as some illustrative Monte Carlo simulations, concerning a stochastic network with weighted connections in which the fraction of nodes that are dynamically synchronized is a parameter. This allows one to…
This paper presents a formal definition of stability for node centrality measures in weighted graphs. It is shown that the commonly used measures of degree, closeness and eigenvector centrality are stable whereas betweenness centrality is…
We study the boundary stabilization of one-dimensional cross-diffusion systems in a moving domain. We show first exponential stabilization and then finite-time stabilization in arbitrary small-time of the linearized system around uniform…
The fastest algorithms for edge coloring run in time $2^m n^{O(1)}$, where $m$ and $n$ are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes $2^{\Theta(n^2)}$. This is a somewhat unique…
Delayed loss spikes have been reported in neural-network training, but existing theory mainly explains earlier non-monotone behavior caused by overly large fixed learning rates. We study one stylized hypothesis: normalization can postpone…
We study the stochastic dynamics of evolutionary games, and focus on the so-called `stochastic slowdown' effect, previously observed in (Altrock et. al, 2010) for simple evolutionary dynamics. Slowdown here refers to the fact that a…
We introduce a novel concept of simple loop dwell time and use it to give sufficient conditions for stability of a continuous-time linear switched system where switching between subsystems is governed by an underlying graph. We present a…
Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time step, blue vertices have a non-zero probability of forcing…
Despite decades of research, SE lacks widely accepted models (that offer precise quantitative stable predictions) about what factors most influence software quality. This paper provides a promising result showing such stable models can be…
We study the continuous time dynamics of the Thermal Minority Game. We find that the dynamical equations of the model reduce to a set of stochastic differential equations for an interacting disordered system with non-trivial random…