Lorenz A. Gilch - Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups

dmtcs:3580 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science - https://doi.org/10.46298/dmtcs.3580
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups

Authors: Lorenz A. Gilch 1

  • 1 Institut für Mathematische Strukturtheorie (Math C)

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.


Volume: DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: Random Walks,Regular Languages,Free Products by Amalgamation,Rate of Escape,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1007/bf01383714
  • 10.1007/bf01383714
Random walks on amalgams

3 Documents citing this article

Consultation statistics

This page has been seen 146 times.
This article's PDF has been downloaded 287 times.