Related papers: A path-transformation for random walks and the Rob…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

We consider a random walk in a uniformly elliptic i.i.d. random environment in $\mathbb Z^d$ for $d\ge 2$. It is believed that whenever the random walk is transient in a given direction it is necessarily ballistic. In order to quantify the…

We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a…

We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…

Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part of which relies on a criterion proposed by Fontes, Isopi,…

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…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

In studying the end-to-end distribution function $G(r,N)$ of a worm like chain by using the propagator method we have established that the combinatorial problem of counting the paths contributing to $G(r,N)$ can be mapped onto the problem…

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…

We establish annealed and quenched invariance principles for random walks in random conductances lifted to the p-variation rough path topology, allowing for degenerate environments and long-range jumps. Our proof is based on a unified…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

The walk matrix of an $n$-vertex graph $G$ with adjacency matrix $A$, denoted by $W(G)$, is $[e,Ae,\ldots,A^{n-1}e]$, where $e$ is the all-ones vector. Let $G\circ P_m$ be the rooted product of $G$ and a rooted path $P_m$ (taking an…

In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…

We consider the simple random walk on the graph corresponding to a Penrose tiling. We prove that the path distribution of the walk converges weakly to that of a non-degenerate Brownian motion for almost every Penrose tiling with respect to…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…

We study the strong form of the ballistic conjecture for random walks in random environments (RWRE). This conjecture asserts that any RWRE which is directionally transient for a nonempty open set of directions satisfies condition $(T)$…

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the \emph{quantum walk characteristic polynomial} $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum…

In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…