Related papers: Convex Hulls of Multiple Random Walks: A Large-Dev…
We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…
Convex records have an appealing purely geometric definition. In a sequence of $d$-dimensional data points, the $n$-th point is a convex record if it lies outside the convex hull of all preceding points. We specifically focus on the…
We study the set of directions asymptotically explored by a spatially homogeneous random walk in $d$-dimensional Euclidean space. We survey some pertinent results of Kesten and Erickson, make some further observations, and present some…
We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
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…
Brownian motion is a Gaussian process described by the central limit theorem. However, exponential decays of the positional probability density function $P(X,t)$ of packets of spreading random walkers, were observed in numerous situations…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
This article studies discrete height functions on the discrete hypertorus. These are functions on the vertices of this hypertorus graph for which the derivative satisfies a specific condition on each edge. We then perform a random walk on…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
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,…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We consider a previously devised model describing Levy random walks (Phys. Rev E 79, 011110; 80, 031148, (2009)). It is demonstrated numerically that the given model describes Levy random walks with superdiffusive, ballistic, as well as…
Consider a system of particles performing nearest neighbor random walks on the lattice $\ZZ$ under hard--core interaction. The rate for a jump over a given bond is direction--independent and the inverse of the jump rates are i.i.d. random…
The horizontal dynamics of a bouncing ball interacting with an irregular surface is investigated and is found to demonstrate behavior analogous to a random walk. Its stochastic character is substantiated by the calculation of a permutation…
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
For idealized (spherical, smooth) dark matter halos described by single-parameter density profiles (such as the NFW profile) there exists a one-to-one mapping between the energy of the halo and the scale radius of its density profile. The…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…