Skip to main content
Erschienen in: Soft Computing 2/2021

03.08.2020 | Methodologies and Application

Algorithm for determining the mutual impact of nodes in weighted directed graphs

verfasst von: Dmytro Lande, Oleh Dmytrenko, Minglei Fu, Minchao Hu, Dmytro Manko, Andrei Snarskii

Erschienen in: Soft Computing | Ausgabe 2/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We propose an algorithm for computing the influence matrix and rank distribution of nodes of a weighted directed graph by calculating the nodes’ mutual impact. The algorithm of accumulative impact solves problems of dimension and computational complexity arising in the analysis of large complex systems. The algorithm calculates the mutual impact of each pair of vertices, making it possible to rank the nodes according to their importance within the system and to determine the most influential components. It produces results similar to those of the commonly used impulse method when applied to graphs that are impulse-stable in an impulse process, while overcoming the disadvantages of the impulse method in other situations. Results are always obtained regardless of impulse stability; they do not depend on the initial impulse, so that the initial values of the weights affect the calculation results. When elements in the adjacency matrix of the weighted directed graph are multiplied by a constant factor, scale invariance is not violated, and the full affect for each of the nodes scales proportionally. Several examples of analyses of weighted directed graphs, including one related to the practical problem of urban solid waste removal, are provided to demonstrate the advantages of the proposed algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Axelrod R (1976) Structure of decision. The cognitive maps of political elites. Princeton University Press, Princeton Axelrod R (1976) Structure of decision. The cognitive maps of political elites. Princeton University Press, Princeton
Zurück zum Zitat Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725–730CrossRef Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725–730CrossRef
Zurück zum Zitat Coombs CH, Dawes RM, Tversky A (1970) Mathematical psychology: an elementary introduction. Prentice-Hall, Englewood Cliffs, N.J.MATH Coombs CH, Dawes RM, Tversky A (1970) Mathematical psychology: an elementary introduction. Prentice-Hall, Englewood Cliffs, N.J.MATH
Zurück zum Zitat Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41CrossRef Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41CrossRef
Zurück zum Zitat Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215–239CrossRef Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215–239CrossRef
Zurück zum Zitat Kleinberg JM (1998) Authoritative sources in a hyperlinked environment. Proc ACM-SIAM Symp Discrete Algorithms 46(5):604–632MathSciNetMATH Kleinberg JM (1998) Authoritative sources in a hyperlinked environment. Proc ACM-SIAM Symp Discrete Algorithms 46(5):604–632MathSciNetMATH
Zurück zum Zitat Lawyer G (2014) Technical report: performance of the expected force on AS-level inernet topologies. Preprint arXiv:1406.4785 Lawyer G (2014) Technical report: performance of the expected force on AS-level inernet topologies. Preprint arXiv:​1406.​4785
Zurück zum Zitat Milkau U, Bott J (2015) Digitalisation in payments: from interoperability to centralised models? J Paym Strategy Syst 9(3):321–340 Milkau U, Bott J (2015) Digitalisation in payments: from interoperability to centralised models? J Paym Strategy Syst 9(3):321–340
Zurück zum Zitat Page L, Brin S, Motwani R, Winograd T (1997) PageRank: bringing order to the web, Stanford Digital Libraries Working Paper, vol 72 Page L, Brin S, Motwani R, Winograd T (1997) PageRank: bringing order to the web, Stanford Digital Libraries Working Paper, vol 72
Zurück zum Zitat Romanenko V, Milyavsky Y (2017) Combined control of impulse processes in complex systems’ cognitive maps with multirate sampling. In: IEEE international conference on intelligent data acquisition and advanced computing systems: technology and applications, IEEE, pp 8–13. https://doi.org/10.1109/idaacs.2017.8094500 Romanenko V, Milyavsky Y (2017) Combined control of impulse processes in complex systems’ cognitive maps with multirate sampling. In: IEEE international conference on intelligent data acquisition and advanced computing systems: technology and applications, IEEE, pp 8–13. https://​doi.​org/​10.​1109/​idaacs.​2017.​8094500
Metadaten
Titel
Algorithm for determining the mutual impact of nodes in weighted directed graphs
verfasst von
Dmytro Lande
Oleh Dmytrenko
Minglei Fu
Minchao Hu
Dmytro Manko
Andrei Snarskii
Publikationsdatum
03.08.2020
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 2/2021
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-020-05232-9

Weitere Artikel der Ausgabe 2/2021

Soft Computing 2/2021 Zur Ausgabe

Premium Partner