IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i4d10.1007_s11067-025-09686-y.html
   My bibliography  Save this article

Efficiency and Hierarchy in Networks Connecting Heterogeneous Nodes with Heterogeneous Links

Author

Listed:
  • Norma Olaizola

    (Universidad del País Vasco UPV/EHU, Departamento de Análisis Económico)

  • Federico Valenciano

    (Universidad del País Vasco UPV/EHU, Departamento de Métodos Cuantitativos)

Abstract

We address the question of efficiency in a connections model where both nodes and links are heterogeneous. First, efficiency is shown to require a hierarchical organization, coupling the values of the nodes and their visibility. Second, continuity of the technology is shown to guarantee the existence of an efficient network. Third, the architecture of efficient networks is identified. Efficiency is achieved by networks with a single non-trivial component, within which one of the nodes with the highest value is directly connected to the others; some pairs of which may be directly connected so that only the links to the central node generate externalities, while every link between peripheral nodes is only used by the two nodes that it connects and solely to see each other. This is proved by showing that an optimal matching of pairs of nodes and the links which form any given network, i.e. a matching that maximizes the value of the resulting network, yields a network with this structure.

Suggested Citation

  • Norma Olaizola & Federico Valenciano, 2025. "Efficiency and Hierarchy in Networks Connecting Heterogeneous Nodes with Heterogeneous Links," Networks and Spatial Economics, Springer, vol. 25(4), pages 907-933, December.
    • Handle: RePEc:kap:netspa:v:25:y:2025:i:4:d:10.1007_s11067-025-09686-y
    DOI: 10.1007/s11067-025-09686-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-025-09686-y
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-025-09686-y?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:kap:netspa:v:25:y:2025:i:4:d:10.1007_s11067-025-09686-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.