Related papers: Random walks and L\'evy processes as rough paths
Let $(\xi,\eta)$ be a bivariate L\'evy process such that the integral $\int\_0^\infty e^{-\xi\_{t-}} d\eta\_t$ converges almost surely. We characterise, in terms of their \LL measures, those L\'evy processes for which (the distribution of)…
The reflected process of a random walk or L\'evy process arises in many areas of applied probability, and a question of particular interest is how the tail of the distribution of the heights of the excursions away from zero behaves…
Several stochastic processes related to transient L\'evy processes with potential densities $u(x,y)=u(y-x)$, that need not be symmetric nor bounded on the diagonal, are defined and studied. They are real valued processes on a space of…
We prove that the stochastic differential equation $$ Y_{s,t}(x) = Y_{s,s}(x) + \int_0^{t-s} f(Y_{s,s+u}(x)) dX_{s+u}, Y_{s,s}(x)=x\in\R^d. $$ driven by a L\'evy process whose paths have finite p-variation almost surely for some $p\in[1,2)$…
We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…
We call a random point measure infinitely ramified if for every $n\in \mathbb N$, it has the same distribution as the $n$-th generation of some branching random walk. On the other hand, branching L\'evy processes model the evolution of a…
In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…
We construct the law of L\'{e}vy processes conditioned to stay positive under general hypotheses. We obtain a Williams type path decomposition at the minimum of these processes. This result is then applied to prove the weak convergence of…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
We consider a random walk on one-dimensional inhomogeneous graphs built from Cantor fractals. Our study is motivated by recent experiments that demonstrated superdiffusion of light in complex disordered materials, thereby termed L\'evy…
A L\'evy process is said to creep through a curve if, at its first passage time across this curve, the process reaches it with positive probability. We first study this property for bivariate subordinators. Given the graph…
We study the small-time asymptotics of sample paths of L\'evy processes and L\'evy-type processes. Namely, we investigate under which conditions the limit $$\limsup_{t \to 0} \frac{1}{f(t)} |X_t-X_0|$$ is finite resp.\ infinite with…
An important family of stochastic processes arising in many areas of applied probability is the class of L\'evy processes. Generally, such processes are not simulatable especially for those with infinite activity. In practice, it is common…
We discuss the qualitatively new properties of random walks on groups that arise in the situation when the entropy of the step distribution is infinite.
Upper estimates of densities of convolution semigroups of probability measures are given under explicit assumptions on the corresponding L\'evy measure and the L\'evy--Khinchin exponent.
We analyze a specific class of random systems that are driven by a symmetric L\'{e}vy stable noise. In view of the L\'{e}vy noise sensitivity to the confining "potential landscape" where jumps take place (in other words, to environmental…
We suppose that a L\'evy process is observed at discrete time points. A rather general construction of minimum-distance estimators is shown to give consistent estimators of the L\'evy-Khinchine characteristics as the number of observations…
We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…