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

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…

In this paper, we study sharp two-sided heat kernel estimates for a large class of symmetric reflected diffusions with jumps on the closure of an inner uniform domain $D$ in a length metric space. The length metric is the intrinsic metric…

We prove large-time Gaussian upper bounds for continuous-time heat kernels of Laplacians on graphs with unbounded geometry. Our estimates hold for centers of large balls satisfying a Sobolev inequality and volume doubling. Distances are…

We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…

We consider the multi-time correlation and covariance structure of a random surface growth with a wall introduced in arXiv:0904.2607. It is shown that the correlation functions associated with the model along space-like paths have…

Diffusion models (DMs) have emerged as powerful tools for modeling complex data distributions and generating realistic new samples. Over the years, advanced architectures and sampling methods have been developed to make these models…

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…

L\'evy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard…

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 introduce the notion of Bartlett spectral measure for isometrically invariant random measures on proper metric commutative spaces. When the underlying Gelfand pair corresponds to a higher-rank, connected, simple matrix Lie group with…

The Weierstrass random walk is a paradigmatic Markov chain giving rise to a L\'evy-type superdiffusive behavior. It is well known that Special Relativity prevents the arbitrarily high velocities necessary to establish a superdiffusive…

In this paper we consider a representative a priori unstable Hamiltonian system with 2+1/2 degrees of freedom, to which we apply the geometric mechanism for diffusion introduced in the paper Delshams et al., Mem. Amer. Math. Soc. 2006, and…

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…

Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We…

We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…

We study a simple one dimensional sluggish random walk model with subdiffusive growth. In the continuum hydrodynamic limit, the model corresponds to a particle diffusing on a line with a space dependent diffusion constant D(x)=…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

A n-step Pearson-Gamma random walk in Rd starts at the origin and consists of n independent steps with gamma distributed lengths and uniform orientations. The gamma distribution of each step length has a shape parameter q>0. Constrained…

Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on…

We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…