8,511 research outputs found
Spectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities
common in large networks, and modularity is one of the most widely used metrics
for such community structure. In this paper, we introduce a principled
methodology, the Spectral Graph Forge, for generating random graphs that
preserves community structure from a real network of interest, in terms of
modularity. Our approach leverages the fact that the spectral structure of
matrix representations of a graph encodes global information about community
structure. The Spectral Graph Forge uses a low-rank approximation of the
modularity matrix to generate synthetic graphs that match a target modularity
within user-selectable degree of accuracy, while allowing other aspects of
structure to vary. We show that the Spectral Graph Forge outperforms
state-of-the-art techniques in terms of accuracy in targeting the modularity
and randomness of the realizations, while also preserving other local
structural properties and node attributes. We discuss extensions of the
Spectral Graph Forge to target other properties beyond modularity, and its
applications to anonymization
Non-parametric resampling of random walks for spectral network clustering
Parametric resampling schemes have been recently introduced in complex
network analysis with the aim of assessing the statistical significance of
graph clustering and the robustness of community partitions. We propose here a
method to replicate structural features of complex networks based on the
non-parametric resampling of the transition matrix associated with an unbiased
random walk on the graph. We test this bootstrapping technique on synthetic and
real-world modular networks and we show that the ensemble of replicates
obtained through resampling can be used to improve the performance of standard
spectral algorithms for community detection.Comment: 5 pages, 2 figure
Less is More: Real-time Failure Localization in Power Systems
Cascading failures in power systems exhibit non-local propagation patterns
which make the analysis and mitigation of failures difficult. In this work, we
propose a distributed control framework inspired by the recently proposed
concepts of unified controller and network tree-partition that offers strong
guarantees in both the mitigation and localization of cascading failures in
power systems. In this framework, the transmission network is partitioned into
several control areas which are connected in a tree structure, and the unified
controller is adopted by generators or controllable loads for fast timescale
disturbance response. After an initial failure, the proposed strategy always
prevents successive failures from happening, and regulates the system to the
desired steady state where the impact of initial failures are localized as much
as possible. For extreme failures that cannot be localized, the proposed
framework has a configurable design, that progressively involves and
coordinates more control areas for failure mitigation and, as a last resort,
imposes minimal load shedding. We compare the proposed control framework with
Automatic Generation Control (AGC) on the IEEE 118-bus test system. Simulation
results show that our novel framework greatly improves the system robustness in
terms of the N-1 security standard, and localizes the impact of initial
failures in majority of the load profiles that are examined. Moreover, the
proposed framework incurs significantly less load loss, if any, compared to
AGC, in all of our case studies
- …