… In this paper, we present a study on a deterministic partially self-avoiding walk (tourist walk),
… Experiments were conducted using different dynamics concerning the tourist walk. A new …

… Here, τ is the limited tourist memory range or, alternatively, it … The main result presented in
this paper is that deterministic walks … To exemplify the use of the tourist walk in ordinal ranking …

… deterministic partially self-avoiding walk. We focus now on the behavior of the trajectories
produced by each tourist during its walk … on deterministic tourist walks and graph theory. The …

… The tourist follows his route, passing by a transient trajectory … Here we propose the use of
the deterministic tourist walk … ing) and present the tourist walk algorithm as a clustering method, …

… Here we propose a simple and intriguing problem: a deterministic walk over a random … ”
or perhaps the “tourist problem” for short. The deterministic dynamics produces a division of the …

… and moves according to the deterministic rule to go to the nearest point which has not been
visited in the preceding steps deterministic tourist walk. Each trajectory generated by this …

… of the deterministic tourist walk and its impact on the texture recognition performance.
Then, we show the performance of the fast deterministic tourist walk for different k values. …

… [1], in 2001, have introduced a new way to explore disordered systems, with a deterministic
walker which moves having memory μ. The walk was recognized as “Tourist Walk” (TW) [2] …

… froth image texture extraction based on the deterministic tourist walks algorithm. First, a
weighted graph model of a froth image is built using deterministic tourist walks. Next, the degree …

… as random walks [10,11], the study of deterministic walks has … deterministic walk algorithm,
known as the tourist walk (TW) [… tourist walk algorithm can be pictorially viewed as a tourist …