Abstract

We use formal language theory to study syntactic behaviour of random walks on graphs. The set of walks, viewed as sets of words, is a recognizable language. As a consequence, a set of random walks can be formally described by a rational fraction or equivalently by an automaton. Applying these techniques, we compute in a unified way various statistical parameters related to random walks, such as mean cover time, and the mean hitting time.

Full Text

Published Version

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 call

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.