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

DOI10.1016/J.LAA.2024.06.022MaRDI QIDQ6615420zbMATH OpenFDO

Authors Vanni Noferini, María C. Quintana

Publication date 8 October 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2024.06.022

zbMATH Keywords

directed graphIhara's theoremnon-backtracking walkrational functionundirected partundirectizationweighted graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Matrix pencils (15A22) Matrices over function rings in one or more variables (15A54)

Recommendations

• A new weighted Ihara zeta function for a graph
• The Ihara expression of a generalization of the weighted zeta function on a finite digraph
• Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
• Ihara zeta functions of infinite weighted graphs
• Ihara zeta functions of digraphs

Cites work

• A new status index derived from sociometric analysis
• A new weighted Ihara zeta function for a graph
• A non-backtracking Pólya's theorem
• A Theory for Backtrack-Downweighted Walks
• An Ihara formula for partially directed graphs
• Beyond non-backtracking: non-cycling network centrality measures
• Elementary Divisors of AB and BA
• scientific article; zbMATH DE number 3756646 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems
• Non-backtracking walk centrality for directed networks
• Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
• Some spectral properties of the non-backtracking matrix of a graph
• The converse of Abel's theorem on power series
• The deformed consensus protocol
• The deformed graph Laplacian and its applications to network centrality analysis
• The nonlinear eigenvalue problem
• There is no going back: properties of the non-backtracking Laplacian
• Van Dooren's index sum theorem and rational matrices with prescribed structural data
• Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
• Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
• What are zeta functions of graphs and what are they good for?

Cited in

(1)

• Efficient computation of f-centralities and nonbacktracking centrality for temporal networks

This page was built for publication: Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615420)