Related papers: Numerical studies of planar closed random walks
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.
The distribution of the first positive position reached by a random walker starting at the origin is central to the analysis of extremes and records in one-dimensional random walks. In this work, we present a detailed and self-contained…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
The dynamical discrete web is a system of one-dimensional coalescing random walks that evolves in an extra dynamical time parameter. At any deterministic dynamical time, the paths behave as coalescing simple symmetric random walks. This…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
We study a $d$-dimensional random walk with zero mean and finite variance in the Weyl chambers of type C and D. Under optimal moment assumptions we construct positive harmonic functions for random walks killed on exiting Weyl chambers. We…
The t-Martin boundary of a random walk on a half-space with reflected boundary conditions is identified. It is shown in particular that the t-Martin boundary of such a random walk is not stable in the following sense : for different values…
We study the dynamics of the map $x$ to $dx$ (mod 1) on the unit circle. We characterize the invariant finite subsets of this map which are called cycles and are graded by their degrees. By looking at the combinatorial properties of the…
We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
We compute the $t$-Martin boundary of two-dimensional small steps random walks killed at the boundary of the quarter plane. We further provide explicit expressions for the (generating functions of the) discrete $t$-harmonic functions. Our…
We establish variational principles for the Hausdorff and packing dimensions of a class of statistically self-affine sponges, including in particular fractal percolation sets obtained from Bara\'nski and Gatzouras-Lalley carpets and…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
This paper describes joint work with Oded Schramm and Wendelin Werner establishing the values of the planar Brownian intersection exponents from which one derives the Hausdorff dimension of certain exceptional sets of planar Brownian…
We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…
We reconsider the problem of even-visiting random walks in one dimension. This problem is mapped onto a non-Hermitian Anderson model with binary disorder. We develop very efficient numerical tools to enumerate and characterize even-visiting…
Sharp estimates for the length of loop erased random walk between two vertices on the [n]^d -torus, d > 4, are established. The mean length is order n^{d/2} . In dimension 4 we have only an upper bound.
Using a connection between the $q$-oscillator algebra and the coefficients of the high temperature expansion of the frustrated Gaussian spin model, we derive an exact formula for the number of closed random walks of given length and area,…
We study the mixing time of a random walker who moves inside a dynamical random cluster model on the d-dimensional torus of side-length n. In this model, edges switch at rate \mu between open and closed, following a Glauber dynamics for the…