Related papers: Rate functions for random walks on Random conuctan…
We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…
This paper investigates whether two independent Elephant Random Walks (ERWs) on $\mathbb{Z}$, each with a different memory parameter, can meet infinitely often, extending the work of Roy, Takei, and Tanemura. We also study the asymptotic…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
We derive properties of the rate function in Varadhan's (annealed) large deviation principle for multidimensional, ballistic random walk in random environment, in a certain neighborhood of the zero set of the rate function. Our approach…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
We consider a linear Fermi-Pasta-Ulam-Tsingou lattice with random spatially varying material coefficients. Using the methods of stochastic homogenization we show that solutions with long wave initial data converge in an appropriate sense to…
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 prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $\sigma$--record…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
We study the random conductance model on $\mathbb{Z}^d$ with ergodic, unbounded conductances. We prove a Gaussian lower bound on the heat kernel given a polynomial moment condition and some additional assumptions on the correlations of the…
We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike,…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
Different models of random walks on the dual graphs of compact urban structures are considered. Analysis of access times between streets helps to detect the city modularity. The statistical mechanics approach to the ensembles of lazy random…
We consider the operator associated to a random walk on finite volume surfaces with hyperbolic cusps. We study the spectral gap (upper and lower bound) associated to this operator and deduce some rate of convergence of the iterated kernel…
We consider time-series forecasting problems where data is scarce, difficult to gather, or induces a prohibitive computational cost. As a first attempt, we focus on short-term electricity consumption in France, which is of strategic…