arXiv Open Access 2016

Three Ways to Count Walks in a Digraph

Matthew Yancey
Lihat Sumber

Abstrak

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

Topik & Kata Kunci

Penulis (1)

M

Matthew Yancey

Format Sitasi

Yancey, M. (2016). Three Ways to Count Walks in a Digraph. https://arxiv.org/abs/1610.01200

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2016
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓