Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem
DOI10.1137/21m146884xMaRDI QIDQ6094745
Unnamed Author, Peter G. Stechlinski
Publication date: 14 September 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
nonsmooth analysisgeneralized derivativespeer-to-peer networksgraph centralityeigenvalue and eigenvector sensitivitieseigentrust
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Eigenvalues, singular values, and eigenvectors (15A18) Perturbation theory of linear operators (47A55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides
- Multiple eigenvalue sensitivity analysis
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Generalized derivatives of eigenvalues of a symmetric matrix
- Methods of descent for nondifferentiable optimization
- A nonsmooth version of Newton's method
- Taxonomy of trust: categorizing P2P reputation systems
- Lexicographic differentiation of nonsmooth functions
- Introduction to Piecewise Differentiable Equations
- Introduction to Nonsmooth Optimization
- Sensitivity and Stability of Ranking Vectors
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- A vector forward mode of automatic differentiation for generalized derivative evaluation
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Derivatives and Perturbations of Eigenvectors
- Computation of Derivatives of Repeated Eigenvalues and the Corresponding Eigenvectors of Symmetric Matrix Pencils
- Perturbation Theory for Analytic Matrix Functions: The Semisimple Case
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
- A Note on Local Behavior of Multiple Eigenvalues
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- From Eigentrust to a Trust-measuring Algorithm in the Max-Plus Algebra
- First-Order Perturbation Theory for Eigenvalues and Eigenvectors
- Numerical Nonsmooth Optimization
- Generalized Derivatives for Hybrid Systems
This page was built for publication: Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem
