Martin boundary of killed random walks on isoradial graphs (Q2148907): Difference between revisions

This article discusses killed planar random walks on isoradial graphs. Unlike the lattice case, isoradial graphs present some difficulties such as: not translation invariant, do not admit any group structure and are spatially non-homogeneous. In the current work, the authors compute the asymptotics of the Martin kernel, deduce the Martin boundary and show its minimality.