Related papers: Stabilization Time in Weighted Minority Processes
The overall performance or expected excess risk of an iterative machine learning algorithm can be decomposed into training error and generalization error. While the former is controlled by its convergence analysis, the latter can be tightly…
Adaptively controlling and minimizing regret in unknown dynamical systems while controlling the growth of the system state is crucial in real-world applications. In this work, we study the problem of stabilization and regret minimization of…
A proper edge-coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval of consecutive integers. Interval thickness s(G) of a graph G is the smallest number of interval colorable graphs…
We propose an encoding and control strategy for the stabilization of switched systems with limited information, supposing the controller is given for each mode. Only the quantized output and the active mode of the plant at each sampling…
We study majority dynamics on the binomial random graph $G(n,p)$ with $p = d/n$ and $d > \lambda n^{1/2}$, for some large $\lambda>0$. In this process, each vertex has a state in $\{-1,+1 \}$ and at each round every vertex adopts the state…
We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…
We consider a nearly-elastic model system with one degree of freedom. In each collision with the "wall", the system can either lose or gain a small amount of energy due to stochastic perturbation. The weak limit of the corresponding slow…
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…
Temporal graphs have edge sets that change over discrete time steps. Such graphs are temporally connected (TC) if all pairs of vertices can reach each other using paths that traverse the edges in a time-respecting way (temporal paths).…
Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
The slow-coloring game is played by Lister and Painter on a graph $G$. On each round, Lister marks a nonempty subset $M$ of the uncolored vertices, scoring $|M|$ points. Painter then gives a color to a subset of $M$ that is independent in…
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
We study the dynamics of a version of the batch minority game, with random external information and with different types of inhomogeneous decision noise (additive and multiplicative), using generating functional techniques \`{a} la De…
In this article, we study the potential theory of normal tempered stable process which is obtained by time-changing the Brownian motion with a tempered stable subordinator. Precisely, we study the asymptotic behavior of potential density…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
Recent experiments have shown that, often, when training a neural network with gradient descent (GD) with a step size $\eta$, the operator norm of the Hessian of the loss grows until it approximately reaches $2/\eta$, after which it…
The stability of solutions to evolution equations with respect to small stochastic perturbations is considered. The stability of a stochastic dynamical system is characterized by the local stability index. The limit of this index with…
In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…
We study diffusion processes that are stopped or reflected on the boundary of a domain. The generator of the process is assumed to contain two parts: the main part that degenerates on the boundary in a direction orthogonal to the boundary…