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

Deterministic walks in random networks: an application to thesaurus graphs

Author

Listed:
  • Kinouchi, O
  • Martinez, A.S
  • Lima, G.F
  • Lourenço, G.M
  • Risau-Gusman, S

Abstract

In a landscape composed of N randomly distributed sites in Euclidean space, a walker (“tourist”) goes to the nearest one that has not been visited in the last τ steps. This procedure leads to trajectories composed of a transient part and a final cyclic attractor of period p. The tourist walk presents a simple scaling with respect to τ and can be performed in a wide range of networks that can be viewed as ordinal neighborhood graphs. As an example, we show that graphs defined by thesaurus dictionaries share some of the statistical properties of low-dimensional (d=2) Euclidean graphs and are easily distinguished from random link networks which correspond to the d→∞ limit. This approach furnishes complementary information to the usual clustering coefficient and mean minimum separation length.

Suggested Citation

  • Kinouchi, O & Martinez, A.S & Lima, G.F & Lourenço, G.M & Risau-Gusman, S, 2002. "Deterministic walks in random networks: an application to thesaurus graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 315(3), pages 665-676.
    • Handle: RePEc:eee:phsmap:v:315:y:2002:i:3:p:665-676
    DOI: 10.1016/S0378-4371(02)00972-X
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843710200972X
    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/S0378-4371(02)00972-X?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. G. M. Viswanathan & Sergey V. Buldyrev & Shlomo Havlin & M. G. E. da Luz & E. P. Raposo & H. Eugene Stanley, 1999. "Optimizing the success of random searches," Nature, Nature, vol. 401(6756), pages 911-914, October.
    2. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    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. Li, Jianyu & Zhou, Jie & Luo, Xiaoyue & Yang, Zhanxin, 2012. "Chinese lexical networks: The structure, function and formation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(21), pages 5254-5263.
    2. Li, Jianyu & Zhou, Jie, 2007. "Chinese character structure analysis based on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 380(C), pages 629-638.
    3. de Jesus Holanda, Adriano & Torres Pisa, Ivan & Kinouchi, Osame & Souto Martinez, Alexandre & Eduardo Seron Ruiz, Evandro, 2004. "Thesaurus as a complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 344(3), pages 530-536.
    4. Amancio, D.R. & Nunes, M.G.V. & Oliveira, O.N. & Pardo, T.A.S. & Antiqueira, L. & da F. Costa, L., 2011. "Using metrics from complex networks to evaluate machine translation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(1), pages 131-142.

    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. Ferreira, A.S. & Raposo, E.P. & Viswanathan, G.M. & da Luz, M.G.E., 2012. "The influence of the environment on Lévy random search efficiency: Fractality and memory effects," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(11), pages 3234-3246.
    2. Priscila C A da Silva & Tiago V Rosembach & Anésia A Santos & Márcio S Rocha & Marcelo L Martins, 2014. "Normal and Tumoral Melanocytes Exhibit q-Gaussian Random Search Patterns," PLOS ONE, Public Library of Science, vol. 9(9), pages 1-13, September.
    3. Emerson, Isaac Arnold & Amala, Arumugam, 2017. "Protein contact maps: A binary depiction of protein 3D structures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 782-791.
    4. Faedo, Nicolás & García-Violini, Demián & Ringwood, John V., 2021. "Controlling synchronization in a complex network of nonlinear oscillators via feedback linearisation and H∞-control," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    5. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    6. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    7. Igor Belykh & Mateusz Bocian & Alan R. Champneys & Kevin Daley & Russell Jeter & John H. G. Macdonald & Allan McRobie, 2021. "Emergence of the London Millennium Bridge instability without synchronisation," Nature Communications, Nature, vol. 12(1), pages 1-14, December.
    8. Berahmand, Kamal & Bouyer, Asgarali & Samadi, Negin, 2018. "A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 41-54.
    9. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    10. Soh, Harold & Lim, Sonja & Zhang, Tianyou & Fu, Xiuju & Lee, Gary Kee Khoon & Hung, Terence Gih Guang & Di, Pan & Prakasam, Silvester & Wong, Limsoon, 2010. "Weighted complex network analysis of travel routes on the Singapore public transportation system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(24), pages 5852-5863.
    11. Wang, Qingyun & Duan, Zhisheng & Chen, Guanrong & Feng, Zhaosheng, 2008. "Synchronization in a class of weighted complex networks with coupling delays," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(22), pages 5616-5622.
    12. De Montis, Andrea & Ganciu, Amedeo & Cabras, Matteo & Bardi, Antonietta & Mulas, Maurizio, 2019. "Comparative ecological network analysis: An application to Italy," Land Use Policy, Elsevier, vol. 81(C), pages 714-724.
    13. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    14. T. Botmart & N. Yotha & P. Niamsup & W. Weera, 2017. "Hybrid Adaptive Pinning Control for Function Projective Synchronization of Delayed Neural Networks with Mixed Uncertain Couplings," Complexity, Hindawi, vol. 2017, pages 1-18, August.
    15. Sgrignoli, P. & Agliari, E. & Burioni, R. & Schianchi, A., 2015. "Instability and network effects in innovative markets," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 108(C), pages 260-271.
    16. Long Ma & Xiao Han & Zhesi Shen & Wen-Xu Wang & Zengru Di, 2015. "Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    17. Wu, Tianyu & Huang, Xia & Chen, Xiangyong & Wang, Jing, 2020. "Sampled-data H∞ exponential synchronization for delayed semi-Markov jump CDNs: A looped-functional approach," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    18. Liang’an Huo & Fan Ding & Chen Liu & Yingying Cheng, 2018. "Dynamical Analysis of Rumor Spreading Model considering Node Activity in Complex Networks," Complexity, Hindawi, vol. 2018, pages 1-10, November.
    19. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    20. Zhu, Mixin & Zhou, Xiaojun, 2023. "Hybrid opportunistic maintenance policy for serial-parallel multi-station manufacturing systems with spare part overlap," Reliability Engineering and System Safety, Elsevier, vol. 236(C).

    More about this item

    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:eee:phsmap:v:315:y:2002:i:3:p:665-676. 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.