Zobrazeno 1 - 10
of 142
pro vyhledávání: '"Belabbas, Mohamed A."'
In this paper a novel stochastic optimization and extremum seeking algorithm is presented, one which is based on time-delayed random perturbations and step size adaptation. For the case of a one-dimensional quadratic unconstrained optimization proble
Externí odkaz:
http://arxiv.org/abs/2410.20572
We consider an information update system on a gossip network, where a source node encodes information into $n$ total keys such that any subset of at least $k+1$ keys can fully reconstruct the original information. This encoding process follows the pr
Externí odkaz:
http://arxiv.org/abs/2410.19696
Autor:
Belabbas, Mohamed-Ali, Ko, Jehyung
We investigate global dynamic feedback stabilization from a topological viewpoint. In particular, we consider the general case of dynamic feedback systems, whereby the total space (which includes the state space of the system and of the controller) i
Externí odkaz:
http://arxiv.org/abs/2404.18380
Given a training set in the form of a paired $(\mathcal{X},\mathcal{Y})$, we say that the control system $\dot x = f(x,u)$ has learned the paired set via the control $u^*$ if the system steers each point of $\mathcal{X}$ to its corresponding target i
Externí odkaz:
http://arxiv.org/abs/2404.11013
We consider information update systems on a gossip network, which consists of a single source and $n$ receiver nodes. The source encrypts the information into $n$ distinct keys with version stamps, sending a unique key to each node. For decoding the
Externí odkaz:
http://arxiv.org/abs/2402.11462
Autor:
Belabbas, Mohamed-Ali, Chen, Xudong
A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble controllable. I
Externí odkaz:
http://arxiv.org/abs/2402.09692
We study the weighted average consensus problem for a gossip network of agents with vector-valued states. For a given matrix-weighted graph, the gossip process is described by a sequence of pairs of adjacent agents communicating and updating their st
Externí odkaz:
http://arxiv.org/abs/2311.04455
Autor:
Belabbas, Mohamed-Ali, Chen, Xudong
We provide in this paper a sufficient condition for a polynomial dynamical system $\dot x(t) = f(x(t))$ to be super-linearizable, i.e., to be such that all its trajectories are linear projections of the trajectories of a linear dynamical system. The
Externí odkaz:
http://arxiv.org/abs/2301.04048
Autor:
Belabbas, Mohamed-Ali
We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We introduce
Externí odkaz:
http://arxiv.org/abs/2211.02739
Autor:
Belabbas, Mohamed Ali, Chen, Xudong
In a recent paper arXiv:2109.08340, we have exhibited a set of conditions that are necessary for the $H$-property to hold for the class of step-graphons. In this paper, we prove that these conditions are essentially sufficient.
Externí odkaz:
http://arxiv.org/abs/2206.00232