Three Ways to Count Walks in a Digraph
Combinatorics
2016-10-06 v1
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.
Keywords
Cite
@article{arxiv.1610.01200,
title = {Three Ways to Count Walks in a Digraph},
author = {Matthew Yancey},
journal= {arXiv preprint arXiv:1610.01200},
year = {2016}
}