Related papers: Random walks among time increasing conductances: h…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…
We consider metric graphs with Kirchhoff boundary conditions. We study the intrinsic metric, volume doubling and a Poincar\'e inequality. This enables us to prove a parabolic Harnack inequality. The proof involves various techniques from…
We study the asymptotic behavior of solutions to the second boundary value problem for a parabolic PDE of Monge-Amp\`ere type arising from optimal mass transport. Our main result is an exponential rate of convergence for solutions of this…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
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…
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…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
In this paper, we establish stability of parabolic Harnack inequalities for symmetric non-local Dirichlet forms on metric measure spaces under general volume doubling condition. We obtain their stable equivalent characterizations in terms…
We study the heat content on quantum graphs and investigate whether an analogon of the Rayleigh-Faber-Krahn inequality holds. This means that heat content at time $T$ among graphs of equal volume would be maximized by intervals (the graph…
Let $S_n$ be the simple random walk on the integer lattice $\mathbb{Z}^d$. For a Bernstein function $\phi$ we consider a random walk $S^\phi_n$ which is subordinated to $S_n$. Under a certain assumption on the behaviour of $\phi$ at zero we…
We establish the quenched local limit theorem for reversible random walk on $\Z^d$ (with $d\ge 2$) among stationary ergodic random conductances that permit jumps of arbitrary length. The proof is based on the weak parabolic Harnack…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk…
We consider biased random walk among iid, uniformly elliptic conductances on $\mathbb{Z}^d$, and investigate the monotonicity of the velocity as a function of the bias. It is not hard to see that if the bias is large enough, the velocity is…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
In recent years, several experiments highlighted a new type of diffusion anomaly, which was called Brownian yet non-Gaussian diffusion. In systems displaying this behavior, the mean squared displacement of the diffusing particles grows…