Remarks on random walks on graphs and the Floyd boundary
Abstract
We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, p(n)(v,w)≤ C n, where < 1 is the spectral radius, then for any Floyd function f that satisfies Σn=1∞nf(n)<∞, the Dirichlet problem with respect to the Floyd boundary is solvable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.