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
How Shopify Store Optimization Helps Businesses Increase Sales and Build Customer Trust
0dev.to Design

How to Choose a Corian Mandir for a Modern Indian Home
0dev.to Productivity
Integrating AI Agents With Customer Systems: A Practical Guide
0dev.to Productivity

AI Agents for Singapore Healthcare: Build or Buy?
0dev.to Productivity

How to Build an AI-Powered eCommerce Website Using WooCommerce
0dev.to Productivity
C#: Your Code Compiled. That's Where the Good News Ends.
0dev.to C#