Ideas of Knödel and Böhm-Hornik about walks in certain graphs, resembling the classical symmetric random walk on the integers, are combined. All the relevant generating functions (although occasionally quite involved) are made fully explicit.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。