THERMAL SCIENCE

International Scientific Journal

Thermal Science - Online First

online first only

Identifiers for structural warnings of malfunction in power grid networks

ABSTRACT
Although its uninterrupted supply is essential for everyday life, the electricity occasionally experiences disruptions and outages. The work presented in the current paper aims to initiate the research to design a strategy based on advanced approaches of algebraic topology to prevent such malfunctions in a power grid network. Simplicial complexes are constructed to identify higher-order structures embedded in a network and, alongside a new algorithm for identifying delegates of the simplicial complex, are intended to pinpoint each element of the power grid network to its natural layer. Results of this methodology for analysis of a power grid network can single out its elements that are at risk to cause cascade problems which can result in unintentional islanding and blackouts. Further development of the outcomes of research can find implementation in the algorithms of the energy informatics research applications.
KEYWORDS
PAPER SUBMITTED: 2022-06-16
PAPER REVISED: 2022-07-29
PAPER ACCEPTED: 2022-08-11
PUBLISHED ONLINE: 2022-08-13
DOI REFERENCE: https://doi.org/10.2298/TSCI220616115A
REFERENCES
  1. Latora, V., et al., Complex Networks: Principles, Methods and Applications, Cambridge University Press, 2017
  2. Battiston, F., et al., Networks beyond pairwise interactions: Structure and dynamics, Physics Reports, 874,(2020), pp. 1-92
  3. Carlsson, G., Topology and Data, Bull. Am. Math. Soc 46(2), (2009), 255
  4. Islambekov, U., et al., Role of local geometry in robustness of power grid networks, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), (2018), pp. 885-889
  5. Kinney, R., et al., Modeling cascading failures in the North American power grid, The European Physical Journal B - Condensed Matter and Complex Systems volume 46, (2005) pp. 101-107
  6. Nesti, T., et al., Emergence of Scale-Free Blackout Sizes in Power Grids, Phys. Rev. Lett. 125, (2020) 058301
  7. Carreras, B. A., et al., Modeling Blackout Dynamics in Power Transmission Networks with Simple Structure, Hawaii International Conference on System Sciences, (2001)
  8. Espejo, R., et al., Analysis of transmission-power-grid topology and scalability, the European case study, Physica A, 509, (2018), pp. 383-395
  9. Zhao, X., et al., Study on self organized criticality of China power grid blackouts, Energy Conversion and Management, 50, 3, (2009), pp. 658-661
  10. Pagani, G.A., et al., The Power Grid as a complex network: A survey, Physica A, 392, 11, (2013), pp. 2688-2700
  11. Watts, D.J., et al., Collective dynamics of 'small-world' networks, Nature 393, (1998), pp. 440-442
  12. Andjelkovi´c, M., et al., Hierarchical sequencing of online social graphs, Physica A, 436, (2015), pp. 582-595
  13. Maleti´c, S., et al., Simplicial Complexes of Networks and Their Statistical Properties, International Conference on Computational Science (ICCS), Lecture Notes in Computer Science, Springer 5102(II), (2008), pp. 568-575
  14. Holmgren, °A.J. , Using Graph Models to Analyze the Vulnerability of Electric Power Networks, Risk Analysis, 26 (2006), pp. 955-969
  15. Kati´c, N. A., Profitability of smart grid solutions applied in power grid, Thermal Science 20, 2, (2016), pp. 371-382
  16. Ruilian, W., et al., Modelling and control of solar thermal power generation network in smart grid, Thermal Science 25, 4, (2021), pp. 2861-2870
  17. Atkin, R.H., Mathematical structure in human affairs, Heinemann, London (1974)
  18. Johnson, J. H., Some structures and notation of Q-analysis, Environment and Planning B 8, 73, (1981)
  19. Maleti´c, S., et al., Statistical mechanics of simplicial complexes, Atti Semin. Mat. Fis. Univ. Modena Reggio Emilia 58, (2011), pp. 245-261
  20. Nowak, A., et al., From private attitude to public opinion: A dynamic theory of social impact, Psychol. Rev. 97, 362, (1990)
  21. Bron, C., et al., Finding all cliques of an undirected graph, Algorithm 457: finding all cliques of an undirected graph, Commun. ACM (ACM) 16 (1973), pp. 575-577.