The deformed graph Laplacian and its applications to network centrality analysis
From MaRDI portal
(Redirected from Publication:4604568)
centrality indexcomplex networkdeformed graph Laplaciangenerating functionmatrix polynomialnonbacktracking
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eigenvalues, singular values, and eigenvectors (15A18) Matrices over function rings in one or more variables (15A54) Positive matrices and their generalizations; cones of matrices (15B48) Special matrices (15B99) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Recommendations
Cites work
- A new status index derived from sociometric analysis
- Accounting for the role of long walks on networks via a new matrix function
- An Ihara formula for partially directed graphs
- Axioms for Centrality
- Deeper Inside PageRank
- Duality of matrix pencils, Wong chains and linearizations
- Eigenspaces of graphs
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- scientific article; zbMATH DE number 3335806 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Localization Theorems for Nonlinear Eigenvalue Problems
- Locating the Eigenvalues of Matrix Polynomials
- M-matrix characterizations. I: nonsingular M-matrices
- Matrix Polynomials
- Network properties revealed through matrix functions
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
- On the limiting behavior of parameter-dependent network centrality measures
- On the sign characteristics of Hermitian matrix polynomials
- Signless Laplacians of finite graphs
- The converse of Abel's theorem on power series
- The deformed consensus protocol
- Tropical roots as approximations to eigenvalues of matrix polynomials
- Vector Spaces of Linearizations for Matrix Polynomials
- 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
(29)- On the exponential generating function for non-backtracking walks
- On the -nonbacktracking centrality for complex networks: existence and limit cases
- Efficient Weingarten map and curvature estimation on manifolds
- Dynamic Katz and related network measures
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Deformed Laplacians and spectral ranking in directed networks
- Non-backtracking PageRank
- Centrality analysis for modified lattices
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
- A Theory for Backtrack-Downweighted Walks
- Eigenvalues of the non-backtracking operator detached from the bulk
- Beyond non-backtracking: non-cycling network centrality measures
- Non-backtracking alternating walks
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- There is no going back: properties of the non-backtracking Laplacian
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
- Geometric and spectral analysis on weighted digraphs
- Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem
- Maximal colourings for graphs
- Hitting times for second-order random walks
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- Updating Katz centrality by counting walks
- Defective eigenvalues of the non-backtracking matrix
- Complex non-backtracking matrix for directed graphs
- Efficient computation of f-centralities and nonbacktracking centrality for temporal networks
- Spectral properties of the deformed Laplacian matrix of trees and H-join graphs
- Walk based Laplacians for modeling diffusion on complex networks
This page was built for publication: The deformed graph Laplacian and its applications to network centrality analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604568)
