IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v189y2024ics019126152400136x.html
   My bibliography  Save this article

A topological network connectivity design problem based on spectral analysis

Author

Listed:
  • Nakayama, Shoichiro
  • Kobayashi, Shun-ichi
  • Yamaguchi, Hiromichi

Abstract

How to improve network connectivity and which parts of the network are vulnerable are critical issues. We begin by defining an equal distribution problem, in which supplies are distributed equally to all nodes in the network. We then derive a topological network connectivity measure from the convergence speed, which is the second minimum eigenvalue of a Laplacian network matrix. Based on the equal distribution problem, we propose a method for identifying critical links for network connectivity using the derivative of the second minimum eigenvalue. Furthermore, we develop a network design problem that maximizes topological connectivity within a budget creating strengthening network links. The problem is convex programming, and the solution is global. Furthermore, it can be converted into an identical semidefinite programming problem, which requires less computational effort. Finally, we test the developed problems on road networks in the Japanese prefectures of Ishikawa and Toyama to determine their applicability and validity.

Suggested Citation

  • Nakayama, Shoichiro & Kobayashi, Shun-ichi & Yamaguchi, Hiromichi, 2024. "A topological network connectivity design problem based on spectral analysis," Transportation Research Part B: Methodological, Elsevier, vol. 189(C).
    • Handle: RePEc:eee:transb:v:189:y:2024:i:c:s019126152400136x
    DOI: 10.1016/j.trb.2024.103012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S019126152400136X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2024.103012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:transb:v:189:y:2024:i:c:s019126152400136x. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.