Related papers: Heat kernel estimates for anomalous heavy-tailed r…

In this paper random walks on the Penrose lattice are investigated. Heat kernel estimates and the invariance principle are shown.

We prove that the restriction of the vertex-reinforced jump process to a subset of the vertex set is a mixture of vertex-reinforced jump processes. A similar statement holds for the non-linear hyperbolic supersymmetric sigma model. This is…

Motivated by the spectral theory of relativistic atoms, we prove matching upper and lower bounds for the transition density of Hardy perturbations of subordinated Bessel heat kernels. The analysis is based on suitable supermedian functions,…

Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy…

The velocity distributions of stellar tracers in general exhibit weak non-Gaussianity encoding information on the orbital composition of a galaxy and the underlying potential. The standard solution for measuring non-Gaussianity involves…

Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…

We present the first linear time complexity randomized algorithms for unbiased approximation of the celebrated family of general random walk kernels (RWKs) for sparse graphs. This includes both labelled and unlabelled instances. The…

We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

We consider the randomly biased random walk on trees in the slow movement regime as in [HS16], whose potential is given by a branching random walk in the boundary case. We study the heavy range up to the $n$-th return to the root, i.e., the…

We theoretically analyze the properties of a geodesic random walk on the Euclidean $d$-sphere. Specifically, we prove that the random walk's transition kernel is Wasserstein contractive with a contraction rate which can be bounded from…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

For certain natural families of topologies, we study continuity and stability of statistical properties of random walks on linear groups over local fields. We extend large deviation results known in the Archimedean case to non-Archimedean…

In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…

Using an intrinsic approach, we study some properties of random fields which appear as tail fields of regularly varying stationary random fields. The index set is allowed to be a general locally compact Hausdorff Abelian group $\mathbb{G}$.…

A fundamental problem on graph-structured data is that of quantifying similarity between graphs. Graph kernels are an established technique for such tasks; in particular, those based on random walks and return probabilities have proven to…

In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…

Nash or Sobolev inequalities are known to be equivalent to ultracontractive properties of Markov semigroups, hence to uniform bounds on their kernel densities. In this work we present a simple and extremely general method, based on weighted…

In the uniformly discrete case of virtual persistence diagram groups $K(X,A)$, we construct a translation-invariant heat semigroup. The kernels are supported on a countable subgroup $H$, and the restriction to $H$ has Fourier exponent…