IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v390y2011i23p4673-4683.html
   My bibliography  Save this article

On the concepts of complex networks to quantify the difficulty in finding the way out of labyrinths

Author

Listed:
  • Amancio, D.R.
  • Oliveira, O.N.
  • Costa, L. da F.

Abstract

Labyrinths have been a tradition and part of the imagination of the human kind for centuries, and were probably built either as a challenge to make it difficult for someone to find the way out, or for aesthetic purposes. They are conventionally classified according to the country they were built, to the style (Roman, classic and contemporary) or to the construction site. In this study, we show that labyrinths can be modeled as complex networks, whose metrics can be used to classify them in terms of their difficulty to find the way out. This is performed by calculating the absorption time, defined as the time it takes for a particle on an internal node to reach an output node through a random walk. The absorption time correlates well with the shortest paths and length of the networks, as expected, and has a very high correlation (Pearson coefficient of 0.97) with the betweenness, therefore allowing one to quantify the level of complexity of any labyrinth. It is shown that the conventional classification is inappropriate to distinguish between labyrinths, because some with very similar properties exist in different countries or were built in distinct time periods. A refined analysis in 77 famous labyrinths indicated that the majority were built for aesthetic purposes, with relatively small absorption times. Furthermore, with the expectation maximization algorithm, we could combine the complex network metrics to identify four clusters of labyrinths that differ in terms of density and shape.

Suggested Citation

  • Amancio, D.R. & Oliveira, O.N. & Costa, L. da F., 2011. "On the concepts of complex networks to quantify the difficulty in finding the way out of labyrinths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4673-4683.
  • Handle: RePEc:eee:phsmap:v:390:y:2011:i:23:p:4673-4683
    DOI: 10.1016/j.physa.2011.06.079
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111005267
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2011.06.079?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tohalino, Jorge V. & Amancio, Diego R., 2018. "Extractive multi-document summarization using multilayer networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 526-539.
    2. Diego R Amancio, 2015. "Probing the Topological Properties of Complex Networks Modeling Short Written Texts," PLOS ONE, Public Library of Science, vol. 10(2), pages 1-17, February.

    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:phsmap:v:390:y:2011:i:23:p:4673-4683. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.