Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs

DOI10.1137/23m155219xarXiv2202.02888MaRDI QIDQ6154946

Desmond J. Higham, Vanni Noferini, Ryan Wood, Francesca Arrigo

Publication date: 16 February 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.02888

zbMATH Keywords

combinatoricsgenerating functionline graphcomplex networkmatrix functioncentrality measuretemporal networkevolving graphKatz centrality

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• An Ihara formula for partially directed graphs
• Similarity matrices for colored graphs
• On the exponential generating function for non-backtracking walks
• Zeta functions of finite graphs and coverings
• A zeta function with respect to non-backtracking alternating walks for a digraph
• Dynamic Katz and related network measures
• Non-backtracking PageRank
• A new status index derived from sociometric analysis
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
• Non-backtracking walk centrality for directed networks
• The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
• Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
• Beyond non-backtracking: non-cycling network centrality measures
• Block Matrix Formulations for Evolving Networks
• Networks
• Zeta functions of digraphs

This page was built for publication: Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs