Related papers: Random walk on a directed graph and Martin boundar…
In this note, we study the Martin boundary of the simple random walk on an example of directed graph. More precisely, the Martin boundary is shown to be trivial, i.e. there is no non-constant positive harmonic functions. The proof involves…
We consider killed planar random walks on isoradial graphs. Contrary to the lattice case, isoradial graphs are not translation invariant, do not admit any group structure and are spatially non-homogeneous. Despite these crucial differences,…
A classical construction associates to a transient random walk on a discrete group $\Gamma$ a compact $\Gamma$-space $\partial_M \Gamma$ known as the Martin boundary. The resulting crossed product $C^*$-algebra $C(\partial_M \Gamma)…
Given a probability measure on a finitely generated group, its Martin boundary is a way to compactify the group using the Green function of the corresponding random walk. It is known from the work of W. Woess that when a finitely supported…
The Martin compactification is investigated for a d-dimensional random walk which is killed when at least one of it's coordinates becomes zero or negative. The limits of the Martin kernel are represented in terms of the harmonic functions…
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 determine the asymptotic behavior of the Green function for zero-drift random walks confined to multidimensional convex cones. As a consequence, we prove that there is a unique positive discrete harmonic function for these processes (up…
A complete representation of the Martin boundary of killed random walks on a half-space $\Z^{d-1}\times\N^*$ is obtained. In particular, it is proved that the corresponding Martin boundary is homemorphic to the half-sphere ${\cal S}^d_+ =…
We study the asymptotic behavior of the simple random walk on oriented version of $\mathbb{Z}^2$. The considered latticesare not directed on the vertical axis but unidirectional on the horizontal one, with symmetric random orientations…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
We prove that supercritical branching random walk on a transient graph converges almost surely under rescaling to a random measure on the Martin boundary of the graph. Several open problems and conjectures about this limiting measure are…
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
We determine the precise asymptotic behaviour (in space) of the Green kernel of simple random walk with drift on the Diestel-Leader graph $DL(q,r)$, where $q,r \ge 2$. The latter is the horocyclic product of two homogeneous trees with…
We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…
Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…
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…
We are interested in the behaviour of the range of the Campanino and P\'etritis random walk, namely a simple random walk on the lattice $\mathbb Z^2$ with random orientations of the horizontal layers. We also study the range of random walks…
We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…
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…
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…