Searching for small-world and scale-free behaviour in long-term historical data of a real-world power grid

  title={Searching for small-world and scale-free behaviour in long-term historical data of a real-world power grid},
  author={B{\'a}lint Hartmann and Vikt'oria Sug'ar},
  journal={Scientific Reports},
Since the introduction of small-world and scale-free properties, there is an ongoing discussion on how certain real-world networks fit into these network science categories. While the electrical power grid was among the most discussed examples of these real-word networks, published results are controversial, and studies usually fail to take the aspects of network evolution into consideration. Consequently, while there is a broad agreement that power grids are small-world networks and might show… 

Searching for Heavy-Tailed Probability Distributions for Modeling Real-World Complex Networks

This study introduces a new family of generalized Lomax models (GLM) to capture the non-linearity of these heavy-tailed networks and shows that GLM-type distributions are not rare, able to model almost 90% of the tested networks accurately compared to benchmark probability models.

Synchronization dynamics on power grids in Europe and the United States.

Dynamical simulation of the cascade failures on the Europe and United States (U.S.) high-voltage power grids has been done via solving the second-order Kuramoto equation. We show that synchronization

Ensembles of Realistic Power Distribution Networks

A robust, scalable framework to synthesize power distribution networks that resemble their physical counterparts for a given region that can be used by network scientists to analyze complex events in power grids and to perform detailed sensitivity and statistical analyses over ensembles of networks.

Network bypasses sustain complexity

A mathematical theory is developed that elucidates the emergence and consolidation of network bypasses and measures their navigability gain, and shows that networks with complex topologies sustain complexity by different amounts ofnetwork bypasses.

Searching for a new probability distribution for modeling non-scale-free heavy-tailed real-world networks

<p>In this study, we consider large-scale network data sets from different disciplines, namely social networks, collaboration networks, web graphs, citation networks, biological networks, product

A Novel Evaluation Strategy to Artificial Neural Network Model Based on Bionics

A new ANN models evaluation strategy is proposed from the perspective of bionics, and the KIII model is closer to the real biological neural network than other models.



Scale-free networks are rare

A severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks finds robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws.

How rare are power-law networks really?

This paper modifications the well-known Kolmogorov–Smirnov test to achieve even sensitivity along the tail, considering the dependence between the empirical degrees under the null distribution, while guaranteeing sufficient power of the test.

The Ubiquity of Small-World Networks

A new small-world metric, ω (omega), is proposed, which compares network clustering to an equivalent lattice network and path length to a random network, as Watts and Strogatz originally described.

Analysis of Cascading Failures in Small-world Power Grid

The development of complex network theory, especially the discovery of small-world characteristics in power grids, has made people more and more concerned on the structural vulnerability of electric

Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence

A precise measure of ‘small-world-ness’ S is defined based on the trade off between high local clustering and short path length and several key properties of the metric are described and the use of WS canonical models is placed on a more secure footing.

Classes of small-world networks.

Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented.

Small worlds: the dynamics of networks between order and randomness

  • Jie Wu
  • Computer Science
  • 2002
Everyone knows the small-world phenomenon: soon after meeting a stranger, we are surprised to discover that we have a mutual friend, or we are connected through a short chain of acquaintances. In his

Low-rank network decomposition reveals structural characteristics of small-world networks.

This work develops a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively.

The evolution of the topology of high-voltage electricity networks

This paper analyzes the growth of the French 400 kV electricity transmission network from its establishment in 1960 until the year 2000 and evaluates how the topological efficiency and vulnerability measures evolve in the course of time.

Analysis of transmission-power-grid topology and scalability, the European case study