相关论文: A path-transformation for random walks and the Rob…

We use Kashiwara crystal basis theory to associate a random walk W to each irreducible representation V of a simple Lie algebra. This is achieved by endowing the crystal attached to V with a (possibly non uniform) probability distribution…

A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ without colliding. We consider questions related to P. Winkler's…

We give a deterministic, nearly logarithmic-space algorithm that given an undirected graph $G$, a positive integer $r$, and a set $S$ of vertices, approximates the conductance of $S$ in the $r$-step random walk on $G$ to within a factor of…

The Doob transform technique enables the study of a killed random walk (KRW) via a random walk (RW) with transition probabilities tilted by a discrete massive harmonic function. The main contribution of this paper is to transfer this…

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

We construct a coupling between the random walk composed of L\'evy area increments from a $d$-dimensional Brownian motion and a random walk composed of quadratic polynomials of Gaussian random variables. This coupling construction is used…

Under a natural asumption on the drift, the law of the simple random walk on the multidimensional first quadrant conditioned to always stay in the first octant was obtained by O'Connell in [O]. It coincides with that of the image of the…

We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…

In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In…

We consider random walks on the square lattice of the plane along the lines of Heyde (1982, 1993) and den Hollander (1994), whose studies have in part been inspired by the so-called transport phenomena of statistical physics.…

We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

We consider large deviations for nearest-neighbor random walk in a uniformly elliptic i.i.d. environment on $\mathbb{Z}^d$. There exist variational formulae for the quenched and averaged rate functions $I_q$ and $I_a$, obtained by…

Quantum random walks are constructed on operator spaces with the aid of matrix-space lifting, a type of ampliation intermediate between those provided by spatial and ultraweak tensor products. Using a form of Wiener-Ito decomposition, a…

We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW…

Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patience Sorting to a full bijection between the symmetric group…

The original Donsker theorem says that a standard random walk converges in distribution to a Brownian motion in the space of continuous functions. It has recently been extended to enriched random walks and enriched Brownian motion. We use…

The system of one-dimensional symmetric simple random walks, in which none of walkers have met others in a given time period, is called the vicious walker model. It was introduced by Michael Fisher and applications of the model to various…

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…