Skip to content

Latest commit

 

History

History
136 lines (103 loc) · 6.86 KB

README.md

File metadata and controls

136 lines (103 loc) · 6.86 KB
Raw

Critical Infrastructure Networks

Network data collection

DOI

Table of Contents

Data Format

Each network is available in three different formats: .mat, .cvs, and .txt.

  • .mat file contains at least three variables:
    • A is a sparse n-by-n adjacency matrix, where n is the number of nodes (vertices). If a network is undirected and unweighted, then A is symmetric, A(i,j)=1 if there is a link (edge) between nodes i and j, and A(i,j)=0 otherwise. If a network is directed, then A is not necessarily symmetric and A(i,j)=1 if there is a link from i to j (and zero otherwise). If a network is weighted, then A(i,j) is the weight of the link from i to j (a zero weight means no link).
    • E is an edge list. If a network is undirected and unweighted, then E is m-by-2, where m is the number of links and a row [i,j] represents a link between nodes i and j. If a network is directed, then a row [i,j] represents a link from i to j. If a network is weighted, then E is m-by-3, where the 3rd column contains weights.
    • G is a MATLAB graph object representing the network.
  • .cvs and .txt files contain an edge list, which is the same as E above.

Power Grids

1. Western States Power Grid of the United States

  • Path: Critical-Infrastructure-Networks/power-grids/us-western-states/

  • Description: An undirected, unweighted network representing the topology of the Western States Power Grid of the United States. Nodes represent transformers, substations, and generators. Links represent high-voltage transmission lines.

  • Remark: The transmission lines can be directed and weighted (where weight describe their capacity), but this information is not available.

  • Data: Adjacency matrix A, edge list E, and MATLAB graph object G, as described in Data Format.

  • Data Source: Originally compiled by D. Watts and S. Strogatz and used in D.J. Watts and S.H. Strogatz (1998) "Collective dynamics of “small-world” networks," Nature 393, 440-442. Availalbe online at: https://toreopsahl.com/datasets/#uspowergrid

  • Basic Network Properties

Property Value
Number of nodes 4941
Number of links 6594
Density 5.403e-04
Maximum degree 19
Average degree 2.669
Average clustering coefficient 0.106
Number of connected components 1
Diameter 46
Average shortest path length 18.989

alt tag

2. North American Power Grid

  • Path: Critical-Infrastructure-Networks/power-grids/north-american/

  • Description: An undirected, unweighted network representing the topology and geography of the North American Power Grid. Nodes represent transformers, substations, and generators. Links represent high-voltage transmission lines.

  • Data: In addition to the adjacency matrix A, edge list E, and MATLAB graph object G (see Data Format), file powergridNA.mat contains an n-by-3 matrix V describing the geographical coordinates of network nodes: V(i,1)=i is the node ID, V(i,2) is the latitude of node i, and V(i,3) is its longitude. Files powergridNA_E and powergridNA_V contain E and V in both .cvs and .txt formats.

  • Data Source: The network was extracted on March 14, 2016 uing GridKit, a power grid extraction toolkit.

  • Basic Network Properties

Property Value
Number of nodes 14990
Number of links 18804
Density 1.674e-04
Maximum degree 22
Average degree 2.509
Average clustering coefficient 0.103
Number of connected components 1
Diameter 138
Average shortest path length 47.504

alt tag alt tag

3. European Power Grid

  • Path: Critical-Infrastructure-Networks/power-grids/european/

  • Description: An undirected, unweighted network representing the topology and geography of the European Power Grid. Nodes represent transformers, substations, and generators. Links represent high-voltage transmission lines.

  • Data: In addition to the adjacency matrix A, edge list E, and MATLAB graph object G (see Data Format), file powergridEU.mat contains an n-by-3 matrix V describing the geographical coordinates of network nodes: V(i,1)=i is the node ID, V(i,2) is the latitude of node i, and V(i,3) is its longitude. Files powergridEU_E and powergridEU_V contain E and V in both .cvs and .txt formats.

  • Data Source: The network was extracted on March 14, 2016 uing GridKit, a power grid extraction toolkit.

  • Basic Network Properties

Property Value
Number of nodes 13478
Number of links 16922
Density 1.8632e-04
Maximum degree 16
Average degree 2.511
Average clustering coefficient 0.111
Number of connected components 1
Diameter 147
Average shortest path length 49.505

alt tag alt tag

Citing CIN repository

If you find this network data collection useful in your work, I encourage you to cite the repository. You can use the following BibTeX citation:

@misc{KZ_CIN_2017_583631,
  author       = {Konstantin M. Zuev},
  title        = {Kostia-Zuev/Critical-Infrastructure-Networks v1.3},
  month        = may,
  year         = 2017,
  doi          = {10.5281/zenodo.583631},
  url          = {https://doi.org/10.5281/zenodo.583631}
}