Related papers: Diffusions and random walks with prescribed sub-Ga…

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…

We prove an invariance principle for a class of zero-drift spatially non-homogeneous random walks in $\mathbb{R}^d$, which may be recurrent in any dimension. The limit $\mathcal{X}$ is an elliptic martingale diffusion, which may be…

Simple time-reversible systems can generate {\it irreversible} flows satisfying the Second Law of Thermodynamics. Maps, and equivalent random walks, can also do this. We study a pair of time-reversible Baker Maps, $N2$ and $N3$, which…

Diffusion models have had a profound impact on many application areas, including those where data are intrinsically infinite-dimensional, such as images or time series. The standard approach is first to discretize and then to apply…

Assuming the heat kernel on a doubling Dirichlet metric measure space has a sub-Gaussian bound, we prove an asymptotically sharp spectral upper bound on the survival probability of the associated diffusion process. As a consequence, we can…

Diffusion models achieve state-of-the-art performance in generating realistic objects and have been successfully applied to images, text, and videos. Recent work has shown that diffusion can also be defined on graphs, including graph…

An unsupervised learning algorithm to cluster hyperspectral image (HSI) data is proposed that exploits spatially-regularized random walks. Markov diffusions are defined on the space of HSI spectra with transitions constrained to near…

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…

We suggest an explanation of typical incubation times statistical features based on the universal behavior of exit times for diffusion models. We give a mathematically rigorous proof of the characteristic right skewness of the incubation…

We show that the circle packing embedding in $\mathbb{R}^2$ of a one-ended, planar triangulation with polynomial growth is quasisymmetric if and only if the simple random walk on the graph satisfies sub-Gaussian heat kernel estimate with…

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},…

Using properties of diffusion according to a quantum heat kernel constructed as an expectation over classical heat kernels on $S^1$, we probe the non-manifold-like nature of quantized space in a model of (1+1)-dimensional quantum gravity.…

We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…

The standard diffusive spreading, characterized by a Gaussian distribution with mean square displacement that grows linearly with time, can break down, for instance, under the presence of correlations and heterogeneity. In this work, we…

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…

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…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…