Martin boundary of killed random walks on isoradial graphs

preprint2021arXivOpen access

Abstract

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, we compute the asymptotics of the Martin kernel, deduce the Martin boundary and show that it is minimal. Similar results on the grid Zd\mathbb Z^d are derived in a celebrated work of Ney and Spitzer.

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.