Boundaries of random walks on graphs and groups with infinitely many ends (Q756836)

From MaRDI portal





scientific article; zbMATH DE number 4192743
Language Label Description Also known as
default for all languages
No label defined
    English
    Boundaries of random walks on graphs and groups with infinitely many ends
    scientific article; zbMATH DE number 4192743

      Statements

      Boundaries of random walks on graphs and groups with infinitely many ends (English)
      0 references
      0 references
      1989
      0 references
      Given an irreducible random walk \((Z_ n)\) on a locally finite graph G with infinitely many ends, whose transition function is invariant with respect to a closed subgroup \(\Gamma\) of automorphisms of G acting transitively on the vertex set of G, the author studies the asymptotic behavior of \((Z_ n)\) on the space \(\Omega\) of ends of G. Apart of a special case (i.e. if \(\Gamma\) is amenable) \(\Omega\) can be shown to be a Furstenberg boundary, \((Z_ n)\) converges almost surely (towards \(\Omega\)), and the corresponding Dirichlet problem can be solved. If \((Z_ n)\) has finite range, then \(\Omega\) can be identified with the Poisson boundary. Some of the results are applied to discrete groups with finitely many ends.
      0 references
      probability theory on graphs
      0 references
      potential theory of Markov processes
      0 references
      random walk
      0 references
      Dirichlet problem
      0 references

      Identifiers