IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i16p2590-d1461218.html
   My bibliography  Save this article

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

Author

Listed:
  • Roger Arnau

    (Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

  • José M. Calabuig

    (Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

  • Luis M. García-Raffi

    (Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

  • Enrique A. Sánchez Pérez

    (Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

  • Sergi Sanjuan

    (Instituto Universitario de Matemática Pura y Aplicada, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

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.

Suggested Citation

  • Roger Arnau & José M. Calabuig & Luis M. García-Raffi & Enrique A. Sánchez Pérez & Sergi Sanjuan, 2024. "A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs," Mathematics, MDPI, vol. 12(16), pages 1-16, August.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:16:p:2590-:d:1461218
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/16/2590/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/16/2590/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Yin-Ting & Zhou, Wei-Xing, 2023. "Quantifying the status of economies in international crop trade networks: A correlation structure analysis of various node-ranking metrics," Chaos, Solitons & Fractals, Elsevier, vol. 172(C).
    2. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    3. David G. Green, 2023. "Emergence in complex networks of simple agents," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 18(3), pages 419-462, July.
    4. Franken, Jonas & Reinhold, Thomas & Reichert, Lilian & Reuter, Christian, 2022. "The digital divide in state vulnerability to submarine communications cable failure," International Journal of Critical Infrastructure Protection, Elsevier, vol. 38(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:16:p:2590-:d:1461218. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.