Giter Site home page Giter Site logo

setse_and_network_robustness's Introduction

Measuring power grid robustness under variable line loads using graph embedding

This is the code used for my paper applying SETSe to cascading failures in the power-grid. The paper attacks 6 different power grids

This paper explores how graph embedding can be used as a proxy for the robustness of power-grids to cascading failure. It focuses on the Strain Elevation Tension Spring embeddings (SETSe) algorithm and compares it to two other graph embedding algorithms as well as the metrics mean edge capacity and Line Load. These 5 methods are used to model the collapse point of the giant component of the network under random attack. The analysis uses 6 power-grid networks, the IEEE load flow test cases 14, 30, 57, 118, 300 as well as the UK high voltage network.
Usually, cascading failure research uses loadings proportional to the initial flow of the network; this paper deviates from that by loading the edges of the network so that they have different range of tolerances. Over 300,000 attack scenarios are generated for each network and the point that the giant component is lost in each case. The paper finds that SETSe and Line Load are appropriate methods to model robustness with an $R^2$ of 0.915 and 0.95 respectively. Mean edge capacity and the two other embedding methods are not able to effectively model robustness. This is despite the other embeddings methods using 32 dimensional embeddings compared to SETSe's 1. What's more the SETSe algorithm provides a geographical embedding which allows meaningful analysis of the state of the power grid. Overall this paper provides two effective measures for understanding the robustness of the giant component on the power grid and shows the value of network embeddings methods for critical infrastructure.

Code and calculation

The main code file is setse_robustness_code.Rmd. The majority of the code is written in R a small amount uses Python and the Stellar graph library. Most of the calculations of this project were done on the UCL Myriad HPC system. For ease of use the project has a small self-contained R package called RobustnessInternal. This package is documented but has no examples as it is used primarily to simplify the code in the script.

Related repos

This repo depends on the following to other repo's

This work follows on from the paper The spring bounces back. The repository for the code used in that paper is found in SETSe_assortativity_and_clusters

setse_and_network_robustness's People

Watchers

 avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.