Random walk on a directed graph and Martin boundary

preprint2012arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.