Next Article in Journal
Identification of Patterns in CO2 Emissions among 208 Countries: K-Means Clustering Combined with PCA and Non-Linear t-SNE Visualization
Previous Article in Journal
Preface to the Special Issue on “Advances in Machine Learning, Optimization, and Control Applications”
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs

by
Roger Arnau
,
José M. Calabuig
,
Luis M. García-Raffi
,
Enrique A. Sánchez Pérez
* and
Sergi Sanjuan
Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(16), 2590; https://doi.org/10.3390/math12162590
Submission received: 15 July 2024 / Revised: 16 August 2024 / Accepted: 20 August 2024 / Published: 22 August 2024

Abstract

Consider a finite directed graph without cycles in which the arrows are weighted by positive weights. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context of fraud detection. The idea is that the new distance explicitly takes into account the size of the paths in the calculations. It has the distinct characteristic that, when calculated along the same path, it may result in a shorter distance between far-apart vertices than between adjacent ones. This property can be particularly useful for modeling scenarios where the connections between vertices are obscured by numerous intermediate vertices, such as in cases of financial fraud. For example, to hide dirty money from financial authorities, fraudsters often use multiple institutions, banks, and intermediaries between the source of the money and its final recipient. Our distance would serve to make such situations explicit. Thus, although our algorithm is based on arguments similar to those at work for the Bellman–Ford and Dijkstra methods, it is in fact essentially different, since the calculation formula contains a weight that explicitly depends on the number of intermediate vertices. This fact totally conditions the algorithm, because longer paths could provide shorter distances—contrary to the classical algorithms mentioned above. We lay out the appropriate framework for its computation, showing the constraints and requirements for its use, along with some illustrative examples.
Keywords: graph; distance; Bellman–Ford; algorithm; path-length-weighted graph; distance; Bellman–Ford; algorithm; path-length-weighted

Share and Cite

MDPI and ACS Style

Arnau, R.; Calabuig, J.M.; García-Raffi, L.M.; Sánchez Pérez, E.A.; Sanjuan, S. A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs. Mathematics 2024, 12, 2590. https://doi.org/10.3390/math12162590

AMA Style

Arnau R, Calabuig JM, García-Raffi LM, Sánchez Pérez EA, Sanjuan S. A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs. Mathematics. 2024; 12(16):2590. https://doi.org/10.3390/math12162590

Chicago/Turabian Style

Arnau, Roger, José M. Calabuig, Luis M. García-Raffi, Enrique A. Sánchez Pérez, and Sergi Sanjuan. 2024. "A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs" Mathematics 12, no. 16: 2590. https://doi.org/10.3390/math12162590

APA Style

Arnau, R., Calabuig, J. M., García-Raffi, L. M., Sánchez Pérez, E. A., & Sanjuan, S. (2024). A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs. Mathematics, 12(16), 2590. https://doi.org/10.3390/math12162590

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop