Skip to content
Open access

Network Monitoring Using Spectrum-Reduced Laplacian Energy Bounds

Aug 2026 · Journal of Intelligent Decision Making and Information Science · 0 citations · 11 references

TL;DR

The experimental results show that gradual edge modifications produce relatively small changes in the monitoring indicators, whereas targeted hub failures lead to larger variations in the optimized bounds and the optimization gap.

Abstract

Monitoring structural changes in large-scale networks is important in many applications, including communication, social, collaboration, and transportation systems. In this paper, we apply the optimized parametric spectrum-reduced bounds for Laplacian energy developed in our previous theoretical work to the problem of structural network monitoring. The proposed framework evaluates optimized lower and upper bounds together with spectral variance, the third central spectral moment, and algebraic connectivity using only a reduced set of spectral quantities and graph invariants. A voting-based decision mechanism is employed to classify the structural state of a network during its evolution. The framework is evaluated on six benchmark datasets representing different classes of real-world networks under four structural modification scenarios: line addition, line removal, targeted hub failure and rewiring. The experimental results show that gradual edge modifications produce relatively small changes in the monitoring indicators, whereas targeted hub failures lead to larger variations in the optimized bounds and the optimization gap. The study demonstrates the practical use of the proposed spectrum-reduced framework for monitoring structural changes without repeated computation of the complete Laplacian spectrum.

Read PDF

Similar papers

Preprint Sep 2026

A Novel Approach for the SDIR Epidemic Model on Online Social Networks

Information diffusion can be controlled by restricting or removing links (edges) in online social networks, as well as in real-world networks. To identify the most influential links to remove while minimizing diffusion, previous studies have proposed upper bounds for spreading processes in SIR and SIS models, using sup...

Phúc Hồng Nguyễn, Duong Khanh Ly, Dung Phi Hoang · 0 citations
Preprint Sep 2026

Edge-based Katz centralities for spatio-temporal multiplex networks

Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastica...

Kai Bergermann, Francesco Gravili, V. Simoncini et al. · 0 citations
Open access Sep 2026

Structure-Aware Bounds for the Distance to Instability in Hierarchical Non-Normal Networks

The distance to instability provides a natural robustness measure for stable continuous-time dynamical systems, but its direct computation can become computationally expensive for large non-normal matrices. In this paper, we develop a structure-aware framework for obtaining certified lower bounds for the distance to in...

L. Cvetković, Zoran Brljak · 0 citations
Open access 2026

Network System Performance Insights through Graph Signal Smoothness

In the field of network analysis and graph theory, the integration of graph signals into the study of complex systems has opened new horizons for understanding and extracting meaningful information. First, graph signals, which capture attributes or measurements associated with nodes in a network, play a key role in bri...

Claudio M. Rocco, K. Barker · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.