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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.