Related papers: Transience in growing subgraphs via evolving sets

We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

We consider continuous time simple random walks with arbitrary speed measure $\theta$ on infinite weighted graphs. Write $p_t(x,y)$ for the heat kernel of this process. Given on-diagonal upper bounds for the heat kernel at two points…

We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

We consider random walks in a balanced i.i.d. random environment in $Z^d$ for $d\ge2$ and the corresponding discrete non-divergence form difference operators. We first obtain an exponential integrability of the heat kernel bounds. We then…

In dealing with thermal transport in composite systems, high contrast materials pose a special problem for numerical simulation: the time scale or step size in the high conductivity material must be much smaller than in the low conductivity…

It is shown in this paper that the transition kernel corresponding to a spatially inhomogeneous random walk on ${\mathbf{Z}}^d$ admits upper and lower Gaussian estimates.

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

We prove upper bounds on the transition probabilities of random walks with i.i.d. random conductances with a polynomial lower tail near $0$. We consider both constant and variable speed models. Our estimates are sharp. As a consequence, we…

We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations…

In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space-time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown…

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

We study models of discrete-time, symmetric, $\Z^{d}$-valued random walks in random environments, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$, with polynomial tail near 0 with exponent $\gamma>0$.…

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 establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…

We study a biased random walk on the interlacement set of $\mathbb{Z}^d$ for $d\geq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually…

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…

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…

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…