Related papers: Vicious Walkers and Hook Young Tableaux
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 introduce an exactly-solvable model of random walk in random environment that we call the Beta RWRE. This is a random walk in $\mathbb{Z}$ which performs nearest neighbour jumps with transition probabilities drawn according to the Beta…
The distribution of the hypervolume $V$ and surface $\partial V$ of convex hulls of (multiple) random walks in higher dimensions are determined numerically, especially containing probabilities far smaller than $P = 10^{-1000}$ to estimate…
In random matrix theory (RMT), the Tracy-Widom (TW) distribution describes the behavior of the largest eigenvalue. We consider here two models in which TW undergoes transformations. In the first one disorder is introduced in the Gaussian…
Asymptotic results are derived for the number of random walks in alcoves of affine Weyl groups (which are certain regions in $n$-dimensional Euclidean space bounded by hyperplanes), thus solving problems posed by Grabiner [J. Combin. Theory…
A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…
We consider a statistical system in a planar wedge, for values of the bulk parameters corresponding to a first order phase transition and with boundary conditions inducing phase separation. Our previous exact field theoretical solution for…
Spatially and temporally inhomogeneous evolution of one-dimensional vicious walkers with wall restriction is studied. We show that its continuum version is equivalent with a noncolliding system of stochastic processes called Brownian…
We consider the diffusion scaling limit of the vicious walker model that is a system of nonintersecting random walks. We prove a functional central limit theorem for the model and derive two types of nonintersecting Brownian motions, in…
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…
We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…
We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
In this article we continue the study of the quenched distributions of transient, one-dimensional random walks in a random environment. In a previous article we showed that while the quenched distributions of the hitting times do not…
In this article, the continuous time random walk on the circle is studied. We derive the corresponding generalized master equation and discuss the effects of topology, especially important when Levy flights are allowed. Then, we work out…
Building upon the knowledge of the distribution of the first positive position reached by a random walker starting from the origin, one can derive new results on the statistics of the gap between the largest and second-largest positions of…
We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…
Scaling mobility patterns have been widely observed for animals. In this paper, we propose a deterministic walk model to understand the scaling mobility patterns, where walkers take the least-action walks on a lattice landscape and prey.…