Related papers: The Einstein relation for random walks on graphs
We prove the Einstein relation, relating the velocity under a small perturbation to the diffusivity in equilibrium, for certain biased random walks on Galton--Watson trees. This provides the first example where the Einstein relation is…
We consider random walk among iid, uniformly elliptic conductances on $\mathbb Z^d$, and prove the Einstein relation (see Theorem 1). It says that the derivative of the velocity of a biased walk as a function of the bias equals the…
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…
In this article, we consider the speed of the random walks in a (uniformly elliptic and i.i.d.) random environment (RWRE) under perturbation. We obtain the derivative of the speed of the RWRE w.r.t. the perturbation, under the assumption…
We study the Einstein relation between diffusion and response to an external field in systems showing superdiffusion. In particular, we investigate a continuous time Levy walk where the velocity remains constant for a time \tau, with…
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…
We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the right by a positive bias $\lambda > 0$, then…
We study single random walks and the electrical resistance for fractals obtained as the limit of a sequence of periodic structures. In the long-scale regime, power laws describe both the mean-square displacement of a random walk as a…
A new proof is given for the formula for the expected return time of a random walk on a graph. This proof makes use of known relationships between electric resistance and random walks.
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
Thermal diffusion has been studied for over 150 years. Despite of the long history and the increasing importance of the phenomenon, the physics of thermal diffusion remains poorly understood. In this paper Ludwig's thermal diffusion is…
In this thesis, we study the diffusive and ballistic behaviors of random walk in random environment (RWRE) in an integer lattice with dimension at least 2. Our contributions are in three directions: a conditional law of large numbers and…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The L\'evy walk model is a stochastic framework of enhanced diffusion with many applications in physics and biology. Here we investigate the time averaged mean squared displacement $\bar{\delta^2}$ often used to analyze single particle…