A Theory for Backtrack-Downweighted Walks

12/05/2020
by   Francesca Arrigo, et al.
0

We develop a complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor. By deriving expressions for the associated generating functions, we also obtain linear systems for computing centrality measures in this setting. In particular, we show that backtrack-downweighted Katz-style network centrality can be computed at the same cost as standard Katz. Studying the limit of this centrality measure at its radius of convergence also leads to a new expression for backtrack-downweighted eigenvector centrality that generalizes previous work to the case where directed edges are present. The new theory allows us to combine advantages of standard and nonbacktracking cases, avoiding localization while accounting for tree-like structures. We illustrate the behaviour of the backtrack-downweighted centrality measure on both synthetic and real networks.

READ FULL TEXT
research
07/26/2023

Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem

It is known that the generating function associated with the enumeration...
research
10/29/2017

A o(d) ·polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]^d

We study monotonicity testing of Boolean functions over the hypergrid [n...
research
05/23/2018

Local time for lattice paths and the associated limit laws

For generalized Dyck paths (i.e., directed lattice paths with any finite...
research
03/10/2019

Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

We give an algorithm for counting self-avoiding walks or self-avoiding p...
research
03/23/2021

Mittag-Leffler functions and their applications in network science

We describe a complete theory for walk-based centrality indices in compl...
research
12/13/2021

On Homotopy of Walks and Spherical Maps in Homotopy Type Theory

We work with combinatorial maps to represent graph embeddings into surfa...

Please sign up or login with your details

Forgot password? Click here to reset