Random walk on a directed graph and Martin boundary
Probability
2012-03-16 v1
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.
Cite
@article{arxiv.1203.3306,
title = {Random walk on a directed graph and Martin boundary},
author = {Basile de Loynes},
journal= {arXiv preprint arXiv:1203.3306},
year = {2012}
}