Related papers: Heat kernel estimates for strongly recurrent rando…
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.…
We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
In this paper, we focus on the heat kernel estimates for diffusions and jump processes on metric measure spaces satisfying a weak chain condition, where the length of a nearly shortest $\varepsilon$-chain between two points $x,y$ is…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
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 study reflected jump diffusions on Ahlfors regular domains in general metric measure spaces. Under the condition that the Dirichlet form on the ambient space satisfies a capacity upper bound estimate, we construct an extension operator…
We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…
The heat kernel on the symmetric space of positive definite Hermitian matrices is used to endow the spaces of Bergman metrics of degree k on a Riemann surface M with a family of probability measures depending on a choice of the background…
The density conjecture for activated random walk on the interval was recently resolved using a new tool called layer percolation. As a step towards understanding how layer percolation extends to activated random walk on more complex graphs,…
Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process…
A scaling limit for the simple random walk on the largest connected component of the Erdos-Renyi random graph in the critical window is deduced. The limiting diffusion is constructed using resistance form techniques, and is shown to satisfy…
We obtain a global estimate of the transition density $p^n(0,x)$ associated to a nearest neighbor random walk, called here "simple", on affine buildings of type $\widetilde{A}_r$. Then we deduce a global estimate of the Green function. This…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…
Kigami showed that a transient random walk on a deterministic infinite tree $T$ induces its trace process on the Martin boundary of $T$. In this paper, we will deal with trace processes on Martin boundaries of random trees instead of…
We study infinite analogues of expander graphs, namely graphs where subgraphs weighted by heat kernels form an expander family. Our main result is that there does not exist any infinite expander in this sense. This proves the analogue for…
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…
We establish a new formula for the heat kernel on regular trees in terms of classical I-Bessel functions. Although the formula is explicit, and a proof is given through direct computation, we also provide a conceptual viewpoint using the…