Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups

Details Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups

2008-07-14

arxiv.org/abs/0807.2264v1

Mathematics

Probability

16 pages

Scientific paper

We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition probabilities depend only on the last two letters of the current word. Furthermore, we consider also the special case of random walks on free products by amalgamation of finite groups which arise in a natural way from random walks on the single factors. The aim of this paper is to compute several equivalent formulas for the rate of escape with respect to natural length functions for these random walks using different techniques.

Affiliated with

Also associated with

No associations

Rating

Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595550