Three Ways to Count Walks in a Digraph

2016/10/04 by Matthew Yancey, Yancey, Matthew
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1610.01200

arxiv created 2016/10/04 · arxiv updated 2016/10/06

Abstract

We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.

Related

• Number of paths in a graph
• Enumeration of walks on lattices. I
• Counting closed walks in infinite regular trees using Catalan and Borel's triangles
• Automatic Classification of Restricted Lattice Walks
• Lattice Walk Enumeration