no code implementations • 11 May 2023 • Adrian Redder, Arunselvan Ramaswamy, Holger Karl
We generalize the Borkar-Meyn stability Theorem (BMT) to distributed stochastic approximations (SAs) with information delays that possess an arbitrary moment bound.
no code implementations • 27 Jan 2022 • Adrian Redder, Arunselvan Ramaswamy, Holger Karl
We show: If for any $p \ge0$ the processes that describe the success of communication between agents in a SSC network are $\alpha$-mixing with $n^{p-1}\alpha(n)$ summable, then the associated AoI processes are stochastically dominated by a random variable with finite $p$-th moment.
no code implementations • 3 Jan 2022 • Adrian Redder, Arunselvan Ramaswamy, Holger Karl
We prove the asymptotic convergence of 3DPG even in the presence of potentially unbounded Age of Information (AoI).
no code implementations • 15 May 2019 • Adrian Redder, Arunselvan Ramaswamy, Daniel E. Quevedo
This work considers the problem of control and resource scheduling in networked systems.