How realistic is it to adopt a quantum random walk model to account for decisions involving two choices? Here, we discuss the neural plausibility and the effect of initial state and boundary thresholds on such a model and contrast it with various features of the classical random walk model of decision making.

The loop-erased random walk (LERW) in three dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.

We give a new proof of a result of Rick Kenyon that the probability that an edge in the middle of an n × n square is used in a loop-erased walk connecting opposites sides is of order n−3/4. We, in fact, improve the result by showing that this estimate is correct up to multiplicative constants.

In this paper we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this model and also show how our model generalizes many other probabilistic models, including random walk in random environment on trees, recursive distributional eq...

We give the exact solution to the problem of a random walk on the Bethe lattice through a mapping on an asymmetric random walk on the half-line. We also study the continuous limit of this model, and discuss in detail the relation between the random walk on the Bethe lattice and Brownian motion on a space of constant negative curvature. PACS : 05.40.+j ; 05.50.+q Electronic addresses : monthus@a...