The deformed graph Laplacian and its applications to network centrality analysis
From MaRDI portal
Publication:4604568
generating functioncomplex networkmatrix polynomialcentrality indexdeformed graph Laplaciannonbacktracking
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Positive matrices and their generalizations; cones of matrices (15B48) Matrices over function rings in one or more variables (15A54) Special matrices (15B99)
Recommendations
Cites work
- 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?)
- 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
- 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
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Network properties revealed through matrix functions
- 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
(23)- Non-backtracking PageRank
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
- Efficient Weingarten map and curvature estimation on manifolds
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Non-backtracking alternating walks
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices
- 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
- Eigenvalues of the non-backtracking operator detached from the bulk
- Deformed Laplacians and spectral ranking in directed networks
- Hitting times for second-order random walks
- On the exponential generating function for non-backtracking walks
- Geometric and spectral analysis on weighted digraphs
- There is no going back: properties of the non-backtracking Laplacian
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
- Centrality analysis for modified lattices
- Dynamic Katz and related network measures
- On the \(\alpha\)-nonbacktracking centrality for complex networks: existence and limit cases
- Beyond non-backtracking: non-cycling network centrality measures
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)
