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

Optimizing random searches on three-dimensional lattices

Author

Listed:
  • Yang, Benhao
  • Yang, Shunkun
  • Zhang, Jiaquan
  • Li, Daqing

Abstract

Search is a universal behavior related to many types of intelligent individuals. While most studies have focused on search in two or infinite-dimensional space, it is still missing how search can be optimized in three-dimensional space. Here we study random searches on three-dimensional (3d) square lattices with periodic boundary conditions, and explore the optimal search strategy with a power-law step length distribution, p(l)∼l−μ, known as Lévy flights. We find that compared to random searches on two-dimensional (2d) lattices, the optimal exponent μopt on 3d lattices is relatively smaller in non-destructive case and remains similar in destructive case. We also find μopt decreases as the lattice length in z direction increases under high target density. Our findings may help us to understand the role of spatial dimension in search behaviors.

Suggested Citation

  • Yang, Benhao & Yang, Shunkun & Zhang, Jiaquan & Li, Daqing, 2018. "Optimizing random searches on three-dimensional lattices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 120-125.
  • Handle: RePEc:eee:phsmap:v:501:y:2018:i:c:p:120-125
    DOI: 10.1016/j.physa.2018.02.100
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118301870
    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.2018.02.100?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.

    References listed on IDEAS

    as
    1. Jon M. Kleinberg, 2000. "Navigation in a small world," Nature, Nature, vol. 406(6798), pages 845-845, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jiang, Jianhua & Yang, Xi & Meng, Xianqiu & Li, Keqin, 2020. "Enhance chaotic gravitational search algorithm (CGSA) by balance adjustment mechanism and sine randomness function for continuous optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    2. Jiang, Jianhua & Xu, Meirong & Meng, Xianqiu & Li, Keqin, 2020. "STSA: A sine Tree-Seed Algorithm for complex continuous optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).

    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. Àlex Arenas & Antonio Cabrales & Leon Danon & Albert Díaz-Guilera & Roger Guimerà & Fernando Vega-Redondo, 2010. "Optimal information transmission in organizations: search and congestion," Review of Economic Design, Springer;Society for Economic Design, vol. 14(1), pages 75-93, March.
    2. Boris Salazar & María del Pilar Castillo, 2008. "Pobreza Urbana Y Exclusión Social De Los Desplazados," Documentos de Trabajo 4500, Universidad del Valle, CIDSE.
    3. Andrea Avena-Koenigsberger & Xiaoran Yan & Artemy Kolchinsky & Martijn P van den Heuvel & Patric Hagmann & Olaf Sporns, 2019. "A spectrum of routing strategies for brain networks," PLOS Computational Biology, Public Library of Science, vol. 15(3), pages 1-24, March.
    4. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    5. Douglas R. White & Jason Owen-Smith & James Moody & Walter W. Powell, 2004. "Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings," Computational and Mathematical Organization Theory, Springer, vol. 10(1), pages 95-117, May.
    6. Cowan, Robin & Jonard, Nicolas & Sanditov, Bulat, 2009. "Fits and Misfits: Technological Matching and R&D Networks," MERIT Working Papers 2009-042, United Nations University - Maastricht Economic and Social Research Institute on Innovation and Technology (MERIT).
    7. Amos Korman & Efrat Greenwald & Ofer Feinerman, 2014. "Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups," PLOS Computational Biology, Public Library of Science, vol. 10(10), pages 1-10, October.
    8. Shi, Xiaolin & Adamic, Lada A. & Strauss, Martin J., 2007. "Networks of strong ties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 33-47.
    9. Peter Biddle & Paul England & Marcus Peinado & Bryan Willman, 2003. "The Darknet and the Future of Content Distribution," Levine's Working Paper Archive 618897000000000636, David K. Levine.
    10. Joost Berkhout & Bernd F. Heidergott, 2019. "Analysis of Markov Influence Graphs," Operations Research, INFORMS, vol. 67(3), pages 892-904, May.
    11. Kondor, Dániel & Mátray, Péter & Csabai, István & Vattay, Gábor, 2013. "Measuring the dimension of partially embedded networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4160-4171.
    12. Lazaros K Gallos & Fabricio Q Potiguar & José S Andrade Jr & Hernan A Makse, 2013. "IMDB Network Revisited: Unveiling Fractal and Modular Properties from a Typical Small-World Network," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-8, June.
    13. Khalid Bakhshaliyev & Mehmet Hadi Gunes, 2020. "Generation of 2-mode scale-free graphs for link-level internet topology modeling," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-23, November.
    14. David Laniado & Yana Volkovich & Salvatore Scellato & Cecilia Mascolo & Andreas Kaltenbrunner, 2018. "The Impact of Geographic Distance on Online Social Interactions," Information Systems Frontiers, Springer, vol. 20(6), pages 1203-1218, December.
    15. Aghabozorgi, Farshad & Khayyambashi, Mohammad Reza, 2018. "A new similarity measure for link prediction based on local structures in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 12-23.
    16. Elena Semenova, 2022. "The small world of German CEOs: a multi-method analysis of the affiliation network structure," Journal of Management & Governance, Springer;Accademia Italiana di Economia Aziendale (AIDEA), vol. 26(2), pages 519-550, June.
    17. Fernando Vega-Redondo, 2008. "Network Organizations," Economics Working Papers ECO2008/09, European University Institute.
    18. Yury A Malkov & Alexander Ponomarenko, 2016. "Growing Homophilic Networks Are Natural Navigable Small Worlds," PLOS ONE, Public Library of Science, vol. 11(6), pages 1-14, June.
    19. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    20. Wang, Haiying & Moore, Jack Murdoch & Small, Michael & Wang, Jun & Yang, Huijie & Gu, Changgui, 2022. "Epidemic dynamics on higher-dimensional small world networks," Applied Mathematics and Computation, Elsevier, vol. 421(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:eee:phsmap:v:501:y:2018:i:c:p:120-125. 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: 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.