Path count asymptotics and Stirling numbers

Abstract

We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.

Misprint corrected. To appear in Proc. Amer. Math. Soc