Backend
Topology Identification of Directed Signed Networks via Repelling Laplacians
arXiv cs.SY0 views
arXiv:2611.06327v1 Announce Type: new Abstract: We address the problem of simultaneously identifying the interaction topology and synchronizing a network interconnected over a directed graph that exhibits both cooperative and antagonistic interactions, modeled via a repelling Laplacian matrix. We propose an adaptive control protocol built on a node-centric regressor formulation, in which the network is driven to track a persistently exciting auxiliary network. We then propose a time-varying adaptive gain to remove the need for global knowledge of the network. We establish uniform semiglobal practical asymptotic stability of the estimation errors when the excitation depends only on measurable errors. Numerical simulations validate the theoretical results.
Source：https://arxiv.org/abs/2611.06327PreviousTransversal Passivity: Dissipation Relative to Input and Output ManifoldsNextOn the Optimality of Implicit Feedback in Markov Decision Processes over Imperfect Links
Related posts
Constrained Black-Box Attacks Against Cooperative Multi-Agent Reinforcement Learning
0arXiv cs.MA
Same Method, Different Task: What the Bitter Lesson Does Not License in Social Simulation
0arXiv cs.MA
Conjugate priors for Bayesian Variable Selection in exponential family Generalized Linear Models
0arXiv stat.TH
Optimal distribution-free sequential change detection with conformal martingales
0arXiv stat.TH
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
0arXiv stat.TH
TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising
0arXiv cs.IR