Related papers: Windings of planar random walks and averaged Dehn …

As a model of market price, we introduce a new type of random walk in a moving potential which is approximated by a quadratic function with its center given by the moving average of its own trace. The properties of resulting random walks…

Euclidean invariant Klein-Gordon, Dirac and massive Chern-Simons field theories are constructed in terms of a random walk with a spin factor on a three dimensional lattice. We exactly calculate the free energy and the correlation functions…

For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…

Expressions for scaling limits of random walks, such as those obtained in several areas of the Probability theory literature, are of great significance in characterizing long term, stationary behavior of random processes. Presumably, in the…

We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…

The aim of the presented research is to give a rigorous mathematical approach to Feynman path integrals based on strong (pathwise) approximations based on simple random walks.

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the…

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one dimensional integer lattice with zero mean, infinite variance and i.i.d. increments $X_n$. We obtain an upper and lower bounds of the potential function, $a(x)$, of…

Let (Y, Z) denote the solution to a forward-backward SDE. If one constructs a random walk B n from the underlying Brownian motion B by Skorohod embedding, one can show L 2 convergence of the corresponding solutions (Y n , Z n) to (Y, Z). We…

A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…

We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times, these being $\approx n\log n$ and $\approx \frac32n\log n$…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

We study the statistics of the number of records $R_n$ for a symmetric, $n$-step, discrete jump process on a $1D$ lattice. At a given step, the walker can jump by arbitrary lattice units drawn from a given symmetric probability…

We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…