Related papers: Heat kernel estimates for strongly recurrent rando…
In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the…
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 establish Gaussian-type upper bounds on the heat kernel for a continuous-time random walk on a graph with unbounded weights under an ergodicity assumption. For the proof we use Davies' perturbation method, where we show a maximal…
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…
Sub-Gaussian estimates for the natural random walk is typical of many regular fractal graphs. Subordination shows that there exist heavy tailed jump processes whose jump indices are greater than or equal to two. However, the existing…
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 establish two-sided heat kernel estimates for random conductance models with non-uniformly elliptic (possibly degenerate) stable-like jumps on graphs. These are long range counterparts of well known two-sided Gaussian heat kernel…
We establish heat kernel upper bounds for a continuous-time random walk under unbounded conductances satisfying an integrability assumption, where we correct and extend recent results by the authors to a general class of speed measures. The…
Graph-structured data arise in wide applications, such as computer vision, bioinformatics, and social networks. Quantifying similarities among graphs is a fundamental problem. In this paper, we develop a framework for computing graph…
The relation between the expectation values computed in the random walk theory, and the heat kernel method for the diffusion equation is explained concretely. The random walk is also realized by simulations and their statistical…
In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.
We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…
For any graph having a suitable uniform Poincare inequality and volume growth regularity, we establish two-sided Gaussian transition density estimates and parabolic Harnack inequality, for constant speed continuous time random walks…
In this paper we consider a time-continuous random walk in $\mathbb{Z}^d$ in a dynamical random environment with symmetric jump rates to nearest neighbours. We assume that these random conductances are stationary and ergodic and, moreover,…
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…
We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated…
We consider on-diagonal heat kernel estimates and the laws of the iterated logarithms for a switch-walk-switch random walk on a lamplighter graph under the condition that the random walk on the underlying graph enjoys sub-Gaussian heat…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…