Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

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

Abstract

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.
Fichier principal
Vignette du fichier
dmAI0127.pdf (160.11 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01194658 , version 1 (07-09-2015)

Identifiers

Cite

Lorenz A. Gilch. Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.405-420, ⟨10.46298/dmtcs.3580⟩. ⟨hal-01194658⟩

Collections

INSMI TDS-MACS
44 View
442 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More