上下文无关的组对。II -割、树集和随机游动
Context-free pairs of groups. II - cuts, tree sets, and random walks
摘要：
这是Ceccherini-Silberstein和Woess开始的关于Muller和Schupp意义上的上下文无关群对以及相关上下文无关图的研究的延续。而不是锥（连接组件相对于删除有限球相对于图度量），一个更一般的方法，上下文无关的图提出了通过树集组成的图的切割，和相关的结构树。研究了具有某些“好”性质的树集的存在性。通过树集，自然的上下文无关语法相关联。这些对上下文无关对结构的研究，分别是对上下文无关对结构的研究。然后，通过复分析，将图应用于研究随机游动渐近性。
英文摘要：
This is a continuation of the study, begun by Ceccherini-Silberstein and Woess, of context-free pairs of groups and the related context-free graphs in the sense of Muller and Schupp. Instead of the cones (connected components with respect to deletion of finite balls with respect to the graph metric), a more general approach to context-free graphs is proposed via tree sets consisting of cuts of the graph, and associated structure trees. The existence of tree sets with certain "good" properties is studied. With a tree set, a natural context-free grammar is associated. These investigations of the structure of context free pairs, resp. graphs are then applied to study random walk asymptotics via complex analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
