Related papers: The looping rate and sandpile density of planar gr…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We consider the simple random walk on supercritical percolation clusters in the multidimensional cubic lattice. In this model, a quenched large deviation principle holds for the position of the random walk. Its rate function depends on the…
The dynamic behavior of the slip length in a fluid flow confined between atomically smooth surfaces is investigated using molecular dynamics simulations. At weak wall-fluid interactions, the slip length increases nonlinearly with the shear…
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 presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…
A two-dimensional lattice model for the formation and evolution of shear bands in granular media is proposed. Each lattice site is assigned a random variable which reflects the local density. At every time step, the strain is localized…
Simulations of a stochastic fixed-energy sandpile in one and two dimensions reveal slow relaxation of the order parameter, even far from the critical point. The decay of the activity is best described by a stretched-exponential form. The…
We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a…
A density-functional approach on the hexagonal graphene lattice is developed using an exact numerical solution to the Hubbard model as the reference system. Both nearest-neighbour and up to third nearest-neighbour hoppings are considered…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
We introduce a technique using nonbacktracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of nontrivial cycles in simple random walk to that in nonbacktracking random walk. We…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…
A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random waker moves. On the other hand, the return probability of…
We derive a general formula for computing the expected first return time of a random walk on a finite graph. Using this framework, we calculate the expected first return time in various settings over bounded rectangular grids with different…
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…