Related papers: Brownian intersections, cover times and thick poin…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth,…

In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…

We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…

The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…

Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…

We derive asymptotics for the probability of the origin to be an extremal point of a random walk in R^n. We show that in order for the probability to be roughly 1/2, the number of steps of the random walk should be between e^{c n / log n}$…

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…

A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…

We give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…

Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…

We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…