Related papers: Some locally self-interacting walks on the integer…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…
We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration $t_w$ and random long-range jumps. While the time the walker needs to cover all the…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…
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…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
We consider dynamic random walks where the nearest neighbour jump rates are determined by an underlying supercritical contact process in equilibrium. This has previously been studied by den Hollander and dos Santos and den Hollander, dos…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
One usually thinks of a cat moving from one room to another in an apartment as random walk model. Imagine now that it also has the possibility to go from one apartment to another by crossing some corridors. That yields a new probabilistic…
In human crowds, interactions among individuals give rise to a variety of self-organized collective motions that help the group to effectively solve the problem of coordination. However, it is still not known exactly how humans adjust their…
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
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 apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two independent uniform random neighbours. We prove that this…
There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…