On the exponential generating function for non-backtracking walks
We derive an explicit formula for the exponential generating function associated with non-backtracking walks around a graph. We study both undirected and directed graphs. Our results allow us to derive computable expressions for non-backtracking versions of network centrality measures based on the m...
Main Authors: | Arrigo, F, Grindrod, P, Higham, D, Noferini, V |
---|---|
Format: | Journal article |
Published: |
Elsevier
2018
|
Similar Items
Similar Items
-
Non-backtracking walk centrality for directed networks
by: Arrigo, F, et al.
Published: (2017) -
Non-backtracking walks reveal compartments in sparse chromatin interaction networks
by: K. Polovnikov, et al.
Published: (2020-07-01) -
Communities in C. elegans connectome through the prism of non-backtracking walks
by: Arsenii A. Onuchin, et al.
Published: (2023-12-01) -
Backtracking algorithm for lexicon generation
by: Constantin Ciubotaru
Published: (2021-04-01) -
Lattice walks ending on a coordinate hyperplane avoiding backtracking and repeats
by: John Machacek
Published: (2021-08-01)