Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2410.00126

Help | Advanced Search

Computer Science > Social and Information Networks

arXiv:2410.00126 (cs)
[Submitted on 30 Sep 2024 (v1) , last revised 29 Jan 2025 (this version, v2)]

Title: Spectrum Optimization of Dynamic Networks for Reduction of Vulnerability Against Adversarial Resonance Attacks

Title: 动态网络的频谱优化以减少对抗共振攻击的脆弱性

Authors:Alp Sahin, Nicolas Kozachuk, Rick S. Blum, Subhrajit Bhattacharya
Abstract: Resonance is a well-known phenomenon that happens in systems with second order dynamics. In this paper we address the fundamental question of making a network robust to signal being periodically pumped into it at or near a resonant frequency by an adversarial agent with the aim of saturating the network with the signal. Towards this goal, we develop the notion of network vulnerability, which is measured by the expected resonance amplitude on the network under a stochastically modeled adversarial attack. Assuming a second order dynamics model based on the network graph Laplacian matrix and a known stochastic model for the adversarial attack, we propose two methods for minimizing the network vulnerability through optimization of the spectrum of the network graph. We provide extensive numerical results analyzing the effects of both methods.
Abstract: 共振是一种在二阶动力系统中发生的众所周知的现象。 在本文中,我们解决了一个基本问题,即如何使网络对敌对代理周期性地在其共振频率附近注入信号时具有鲁棒性,目的是使网络饱和于该信号。 为了达到这个目标,我们提出了网络脆弱性的概念,该概念通过在随机建模的敌对攻击下网络上的预期共振振幅来衡量。 假设基于网络图拉普拉斯矩阵的二阶动力学模型和敌对攻击的已知随机模型,我们提出了两种通过优化网络图谱来最小化网络脆弱性的方法。 我们提供了大量的数值结果来分析这两种方法的效果。
Comments: 13 pages, 18 figures
Subjects: Social and Information Networks (cs.SI) ; Optimization and Control (math.OC)
Cite as: arXiv:2410.00126 [cs.SI]
  (or arXiv:2410.00126v2 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2410.00126
arXiv-issued DOI via DataCite

Submission history

From: Subhrajit Bhattacharya [view email]
[v1] Mon, 30 Sep 2024 18:07:18 UTC (38,953 KB)
[v2] Wed, 29 Jan 2025 14:53:55 UTC (39,051 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.SI
< prev   |   next >
new | recent | 2024-10
Change to browse by:
cs
math
math.OC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号