Related papers: Walkers on the circle
We study coupled random walks in the plane such that, at each step, the walks change direction by a uniform random angle plus an extra deterministic angle \theta. We compute the Hausdorff dimension of the \theta for which the walk has an…
Computer-based simulation of pedestrian dynamics reached meaningful results in the last decade, thanks to empirical evidences and acquired knowledge fitting fundamental diagram constraints and space utilization. Moreover, computational…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These…
In this paper we deal with pedestrian modeling, aiming at simulating crowd behavior in normal and emergency scenarios, including highly congested mass events. We are specifically concerned with a new agent-based, continuous-in-space,…
Minimizing social contact is an important tool to reduce the spread of diseases, but harms people's well-being. This and other, more compelling reasons, urge people to walk outside periodically. The present simulation explores how…
On the complete graph ${\cal{K}}_M$ with $M \ge3$ vertices consider two independent discrete time random walks $\mathbb{X}$ and $\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\mathbb{X} = \{ X_1, X_2, \dots…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…
Extremal spacings between eigenvalues of random unitary matrices of size N pertaining to circular ensembles are investigated. Explicit probability distributions for the minimal spacing for various ensembles are derived for N = 4. We study…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
This paper analyzes the meeting time between a pair of pursuer and evader performing random walks on digraphs. The existing bounds on the meeting time usually work only for certain classes of walks and cannot be used to formulate…
We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in…
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…