Abstract
We present all steps which are necessary in order to classify all locally finite, infinite graphs which carry a quasi transitive random walk that is recurrent. Some new and/or simpler proofs are given. Most of them rely on the fact that autmomorphism groups of locally finite graphs are locally compact with respect to the topology of pointwise convergence—this allows the use of integration on these groups.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Rendiconti del Seminario Matematico e Fisico di Milano
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
