Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem
DOI10.1016/J.LAA.2024.06.022zbMATH Open1548.05148MaRDI QIDQ6615420
María C. Quintana, Vanni Noferini
Publication date: 8 October 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
rational functiondirected graphweighted graphnon-backtracking walkIhara's theoremundirected partundirectization
Exact enumeration problems, generating functions (05A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices over function rings in one or more variables (15A54) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Matrix pencils (15A22) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A non-backtracking Pólya's theorem
- An Ihara formula for partially directed graphs
- Some spectral properties of the non-backtracking matrix of a graph
- Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems
- The deformed consensus protocol
- A new weighted Ihara zeta function for a graph
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- The converse of Abel's theorem on power series
- A new status index derived from sociometric analysis
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
- Non-backtracking walk centrality for directed networks
- The nonlinear eigenvalue problem
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
- A Theory for Backtrack-Downweighted Walks
- Beyond non-backtracking: non-cycling network centrality measures
- Van Dooren's Index Sum Theorem and Rational Matrices with Prescribed Structural Data
- Elementary Divisors of AB and BA
- There is no going back: properties of the non-backtracking Laplacian
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
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)