IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v92y2019i6d10.1140_epjb_e2019-100100-8.html
   My bibliography  Save this article

Problem-solving using complex networks

Author

Listed:
  • Henrique F. de Arruda

    (Institute of Mathematics and Computer Science, University of São Paulo)

  • Cesar H. Comin

    (Federal University of São Carlos)

  • Luciano da F. Costa

    (São Carlos Institute of Physics, University of São Paulo)

Abstract

The present work addresses the issue of using complex networks as artificial intelligence mechanisms. More specifically, we consider the situation in which puzzles, represented as complex networks of varied types, are to be assembled by complex network processing engines of diverse structures. The puzzle pieces are initially distributed on a set of nodes chosen according to different criteria, including degree and eigenvector centrality. The pieces are then repeatedly copied to the neighboring nodes. The provision of buffering of different sizes are also investigated. Several interesting results are identified, including the fact that BA-based assembling engines tend to provide the fastest solutions. It is also found that the distribution of pieces according to the eigenvector centrality almost invariably leads to the best performance. Another result is that using the buffer sizes proportional to the degree of the respective nodes tend to improve the performance. Graphical abstract

Suggested Citation

  • Henrique F. de Arruda & Cesar H. Comin & Luciano da F. Costa, 2019. "Problem-solving using complex networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 92(6), pages 1-9, June.
    • Handle: RePEc:spr:eurphb:v:92:y:2019:i:6:d:10.1140_epjb_e2019-100100-8
    DOI: 10.1140/epjb/e2019-100100-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1140/epjb/e2019-100100-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1140/epjb/e2019-100100-8?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.

    More about this item

    Keywords

    Statistical and Nonlinear Physics;

    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:spr:eurphb:v:92:y:2019:i:6:d:10.1140_epjb_e2019-100100-8. 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.