Related papers: Random walks and L\'evy processes as rough paths
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
Lock step walker model is a one-dimensional integer lattice walker model in discrete time. Suppose that initially there are infinitely many walkers on the non-negative even integer sites. At each tick of time, each walker moves either to…
Consider a random walk on $\mathbb{Z}^d$ in a translation-invariant and ergodic random environment and starting from the origin. In this short note, assuming that a quenched invariance principle for the opportunely-rescaled walks holds, we…
Under an appropriate regular variation condition, the affinely normalized partial sums of a sequence of independent and identically distributed random variables converges weakly to a non-Gaussian stable random variable. A functional version…
L\'{e}vy walks are a particular type of continuous-time random walks which results in a super-diffusive spreading of an initially localized packet. The original one-dimensional model has a simple schematization that is based on starting a…
We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely…
We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…
We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by Greene-Nijenhuis-Wilf, performed under the graph of a continual Young diagram. The limiting point of these…
Properties of random and fluctuating systems are often studied through the use of Gaussian distributions. However, in a number of situations, rare events have drastic consequences, which can not be explained by Gaussian statistics.…
In this paper we derive a technique of obtaining limit theorems for suprema of L\'evy processes from their random walk counterparts. For each $a>0$, let $\{Y^{(a)}_n:n\ge 1\}$ be a sequence of independent and identically distributed random…
Levy walks are random processes with an underlying spatiotemporal coupling. This coupling penalizes long jumps, and therefore Levy walks give a proper stochastic description for a particle's motion with broad jump length distribution. We…
We consider a sparse Erd\H{o}s--R\'{e}nyi graph $\mathcal{G}(n,\lambda/n)$ where each edge is independently assigned a random signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and…
Calibrating a L\'evy process usually requires characterizing its jump distribution. Traditionally this problem can be solved with nonparametric estimation using the empirical characteristic functions (ECF), assuming certain regularity, and…
The expected signature kernel arises in statistical learning tasks as a similarity measure of probability measures on path space. Computing this kernel for known classes of stochastic processes is an important problem that, in particular,…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…
In this paper we investigate the asymptotic properties of the wait-first and jump-first L\'evy walk with rest, which is a generalization of standard jump-first and jump-first L\'evy walk that assumes each waiting time in the model is a sum…
The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…
We define a new type of self-similarity for one-parameter families of stochastic processes, which applies to a number of important families of processes that are not self-similar in the conventional sense. This includes a new class of…
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,…