Non-backtracking alternating walks

DOI10.1137/18M1183698MaRDI QIDQ5231195zbMATH OpenWikidataFDO

Authors Francesca Arrigo, Desmond J. Higham, Vanni Noferini

Publication date 26 August 2019

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18M1183698

zbMATH Keywords

bipartivitycentralitydirected graphgenerating functionmatrix polynomialnetwork

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of matrix exponential and similar matrix functions (65F60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the exponential generating function for non-backtracking walks
• Non-backtracking walk centrality for directed networks
• Beyond non-backtracking: non-cycling network centrality measures
• A Theory for Backtrack-Downweighted Walks
• Non-backtracking PageRank

Cites work

• An Ihara formula for partially directed graphs
• Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
• Authoritative sources in a hyperlinked environment
• Bigraphs versus digraphs via matrices
• Computation of generalized matrix functions
• Discovering bipartite substructure in directed networks
• Edge modification criteria for enhancing the communicability of digraphs
• Harmonic analysis on symmetric spaces -- Euclidean space, the sphere, and the Poincaré upper half plane
• scientific article; zbMATH DE number 3335806 (Why is no real title available?)
• Ihara zeta functions of digraphs
• Localized eigenvectors of the non-backtracking matrix
• Mapping directed networks
• Matrix Analysis
• Matrix inequalities for iterative systems
• Matrix Polynomials
• Matrix polynomials with completely prescribed eigenstructure
• Network properties revealed through matrix functions
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Non-backtracking walk centrality for directed networks
• On generalized matrix functions
• On the exponential generating function for non-backtracking walks
• On the limiting behavior of parameter-dependent network centrality measures
• Ranking hubs and authorities using matrix functions
• Spectral analysis of two-signed microarray expression data
• Spectral redemption in clustering sparse networks
• The deformed graph Laplacian and its applications to network centrality analysis
• The non-backtracking spectrum of the universal cover of a graph
• Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
• What are zeta functions of graphs and what are they good for?
• Zeta functions of finite graphs and coverings

Cited in

(10)

• On the exponential generating function for non-backtracking walks
• A zeta function with respect to non-backtracking alternating walks for a digraph
• Dynamic Katz and related network measures
• Mittag-Leffler functions and their applications in network science
• Beyond non-backtracking: non-cycling network centrality measures
• A weighted alternating zeta function of a digraph
• Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
• Two accelerated non-backtracking PageRank algorithms for large-scale networks
• Alternating L-functions of finite digraphs
• New relations between zeta functions of a graph

This page was built for publication: Non-backtracking alternating walks

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