In this paper, we study the problem of topic-level random walk, which concerns the random walk at the topic level. Previously, several related works such as topic sensitive page rank have been conducted. However, topics in these methods were predefined, which makes the methods inapplicable to different domains. In this paper, we propose a four-step approach for topic-level random walk. We emplo...

If in the classical Turing model the diffusion process (Brownian motion) is replaced by a more general correlated random walk, then the parameters describing spatial spread are the particle speeds and the rates of change in direction. As in the Turing model, a spatially constant equilibrium can become unstable if the different species have different turning rates and different speeds. Furthermo...

This paper presents a learning algorithm for differential decorrelation, the goal of which is to find a linear transform that minimizes the concurrent change of associated output nodes. First the algorithm is derived from the minimization of the objective function which measures the differential correlation. Then we show that the differential decorrelation learning algorithm can also be derived...

In this paper we develop some random walk representations for the spin-S Heisenberg ferromagnet with nearest neighbor interaction on the integer lattice in d dimensions. The representations parallel corresponding representations for the perfect Bose gas. Hence the Heisenberg model can be thought of as an interacting Bose gas. This has been made more explicit in the paper of Dyson (5/ (see also ...

The dynamics of the avalanche width in the evolution model is described using a random walk picture. In this approach the critical exponents for avalanche distribution, τ , and avalanche average time, γ, are found to be the same as in the previous mean field approximation but SOC appear at λ critical = 2/3, which is very close to numerical value. A continuous time random walk is studied numeric...

Abstract. The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-rou...

Issues of resonance that appear in non-standard random walk models are discussed. The first walk is called repulsive delayed random walk, which is described in the context of a stick balancing experiment. It will be shown that a type of ”resonant” effect takes place to keep the stability of the fixed point better with tuned bias and delay. We also briefly discuss the second model called sticky ...