Beyond non-backtracking: non-cycling network centrality measures
From MaRDI portal
Publication:5160872
Recommendations
- On the exponential generating function for non-backtracking walks
- Non-backtracking walk centrality for directed networks
- The deformed graph Laplacian and its applications to network centrality analysis
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- A Theory for Backtrack-Downweighted Walks
Cites work
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 3335806 (Why is no real title available?)
- A first course in network theory
- A new status index derived from sociometric analysis
- An Ihara formula for partially directed graphs
- Collective dynamics of `small-world' networks
- Eigenspaces of graphs
- Elementary Divisors of AB and BA
- Emergence of Scaling in Random Networks
- Functions of Matrices
- Graph similarity scoring and matching
- Harmonic analysis on symmetric spaces -- Euclidean space, the sphere, and the Poincaré upper half plane
- Ihara zeta functions of digraphs
- Matrix Analysis
- Matrix Polynomials
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Network properties revealed through matrix functions
- Networks. An introduction.
- Non-backtracking PageRank
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Non-backtracking alternating walks
- Non-backtracking walk centrality for directed networks
- ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
- On the exponential generating function for non-backtracking walks
- On the limiting behavior of parameter-dependent network centrality measures
- On the sign characteristics of Hermitian matrix polynomials
- Quantum chaos on discrete graphs
- Random matrices, nonbacktracking walks, and orthogonal polynomials
- Similarity matrices for colored graphs
- Spectral clustering and its use in bioinformatics
- Spectral redemption in clustering sparse networks
- The Complexity of Enumeration and Reliability Problems
- The University of Florida sparse matrix collection
- The deformed graph Laplacian and its applications to network centrality analysis
- The non-backtracking spectrum of the universal cover of a graph
- What are zeta functions of graphs and what are they good for?
- Zeta functions of finite graphs and coverings
Cited in
(16)- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
- Mittag-Leffler functions and their applications in network science
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Non-backtracking alternating walks
- Some spectral properties of the non-backtracking matrix of a graph
- A Theory for Backtrack-Downweighted Walks
- Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem
- Maximal colourings for graphs
- On the exponential generating function for non-backtracking walks
- The deformed graph Laplacian and its applications to network centrality analysis
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
- Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
- Dynamic Katz and related network measures
- On the \(\alpha\)-nonbacktracking centrality for complex networks: existence and limit cases
- Non-backtracking walk centrality for directed networks
This page was built for publication: Beyond non-backtracking: non-cycling network centrality measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160872)
