The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies on Laplacian eigenvalues, which approximate the largest and smallest possible cut-sets for a given size of the set V. In this article, we extend the standard spectral approximations by including information about the Laplacian eigenvectors. This additional information leads to provably tighter bounds compared to the standard spectral bounds. We apply our new method to find improved spectral bounds for the well-known Cheeger constant, the Max Cut problem and the expander mixing lemma. We also apply our bounds to study cut sizes in the hypercube graph, and describe an application related to the spreading of epidemics on networks. We further illustrate the performance of our new bounds using simulations, revealing that a significant improvement over the standard bounds is possible.

@en

Due to the open data policies, nowadays, some countries have their power grid data available online. This may bring a new concern to the power grid operators in terms of malicious threats. In this paper, we assess the vulnerability of power grids to targeted attacks based on network science. By employing two graph models for power grids as simple and weighted graphs, we first calculate the centrality metrics of each node in a power grid. Subsequently, we formulate different node-attack strategies based on those centrality metrics, and empirically analyse the impact of targeted attacks on the structural and the operational performance of power grids. We demonstrate our methodology in the high-voltage transmission networks of 5 European countries and in commonly used IEEE test power grids.@en

Determining a set of "important" nodes in a network constitutes a basic endeavor in network science. Inspired by electrical flows in a resistor network, we propose the best conducting node j in a graph G as the minimizer of the diagonal element Qjj† of the pseudoinverse matrix Q† of the weighted Laplacian matrix of the graph G. We propose a new graph metric that complements the effective graph resistance RG and that specifies the heterogeneity of the nodal spreading capacity in a graph. Various formulas and bounds for the diagonal element Qjj† are presented. Finally, we compute the pseudoinverse matrix of the Laplacian of star, path, and cycle graphs and derive an expansion and lower bound of the effective graph resistance RG based on the complement of the graph G.

@en

We propose an approximation framework that unifies and generalizes a number of existing mean-field approximation methods for the susceptible-infected-susceptible (SIS) epidemic model on complex networks. We derive the framework, which we call the unified mean-field framework (UMFF), as a set of approximations of the exact Markovian SIS equations. Our main novelty is that we describe the mean-field approximations from the perspective of the isoperimetric problem, which results in bounds on the UMFF approximation error. These new bounds provide insight in the accuracy of existing mean-field methods, such as the N-intertwined mean-field approximation and heterogeneous mean-field method, which are contained by UMFF. Additionally, the isoperimetric inequality relates the UMFF approximation accuracy to the regularity notions of Szemerédi's regularity lemma.

@en