arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.08304cs.SImath.OCstat.AP
收藏

弹性基础设施网络:基于L1正则化最小二乘的稀疏边变化识别

Resilient Infrastructure Network: Sparse Edge Change Identification via L1-Regularized Least Squares

Rajasekhar Anguluri

AI总结:

针对基础设施网络的边变化中断问题,提出基于ℓ₁范数正则化最小二乘的稀疏边变化识别框架,利用Laplacian矩阵结构避免过参数化,经电力网络等算例验证了鲁棒性与有效性。

摘要:

对抗性行动与快速气候变化正扰乱能源、水务、交通系统等基础设施网络的运行。未被处理的中断会引发全系统停运,凸显了快速、鲁棒的识别方法的必要性。一类重要中断源于网络中的边变化(新增或删除)。我们提出一种ℓ₁范数正则化最小二乘框架,可利用含噪数据识别多个但稀疏的边变化。我们仅针对满足平衡方程的网络展开研究,这类网络在上述领域中十分常见。这类网络中边的存在与否可通过加权对称Laplacian矩阵的稀疏模式表征,而含噪数据为节点注入量与节点势。所提框架系统性地利用了Laplacian矩阵的内在结构,有效避免了过参数化。我们通过一系列以电力网络为核心的代表性算例,验证了该方法的鲁棒性与有效性。

英文摘要:

Adversarial actions and a rapid climate change are disrupting operations of infrastructure networks (e.g., energy, water, and transportation systems). Unaddressed disruptions lead to system-wide shutdowns, emphasizing the need for quick and robust identification methods. One significant disruption arises from edge changes (addition or deletion) in networks. We present an $\ell_1$-norm regularized least-squares framework to identify multiple but sparse edge changes using noisy data. We focus only on networks that obey equilibrium equations, as commonly observed in the above sectors. The presence or lack of edges in these networks is captured by the sparsity pattern of the weighted, symmetric Laplacian matrix, while noisy data are node injections and potentials. Our proposed framework systematically leverages the inherent structure within the Laplacian matrix, effectively avoiding overparameterization. We demonstrate the robustness and efficacy of the proposed approach through a series of representative examples, with a primary emphasis on power networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑