Deterministic walks in random networks: an application to thesaurus graphs

O Kinouchi, A.s Martinez, G.f Lima, G.m Lourenço and S Risau-Gusman

Physica A: Statistical Mechanics and its Applications, 2002, vol. 315, issue 3, 665-676

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.

Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843710200972X
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

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:315:y:2002:i:3:p:665-676

DOI: 10.1016/S0378-4371(02)00972-X

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().