Limits of convolution iterates and properties of random walks defined on regular semigroups with applications to matrix semigoups (Q1123473): Difference between revisions

Consider a right random walk with law \(\mu\) on a locally compact semigroup S. It is always assumed that the support of \(\mu\) generates S as a topological semigroup. For an element x of S the notions essential (x leads to y implies y leads to x) and recurrent (x leads to x i.o.) are in general not equivalent although they agree e.g. on the real line. So the author studies the relation between essential and recurrent elements for regular and completely regular semigroups. Typical results are: No element of a completely regular semigroup without essential elements is recurrent (Theorem 8); let e be an essential element of S (compl. regular) with e \(S\subset S e\), then no element in \(S\setminus Se\) is recurrent (Theorem 6). This paper is well written and contains all the details to understand the proofs.