Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem
DOI10.1137/21M146884XMaRDI QIDQ6094745FDOQ6094745
Authors: Peter Stechlinski
Publication date: 14 September 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
nonsmooth analysispeer-to-peer networksgeneralized derivativesgraph centralityeigenvalue and eigenvector sensitivitieseigentrust
Eigenvalues, singular values, and eigenvectors (15A18) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Perturbation theory of linear operators (47A55) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Methods of descent for nondifferentiable optimization
- A nonsmooth version of Newton's method
- Combinatorial matrix theory
- Introduction to Piecewise Differentiable Equations
- Derivatives and Perturbations of Eigenvectors
- Title not available (Why is that?)
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- Computation of Derivatives of Repeated Eigenvalues and the Corresponding Eigenvectors of Symmetric Matrix Pencils
- Lexicographic differentiation of nonsmooth functions
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- Multiple eigenvalue sensitivity analysis
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Title not available (Why is that?)
- Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides
- Introduction to nonsmooth optimization. Theory, practice and software
- Title not available (Why is that?)
- Perturbation Theory for Analytic Matrix Functions: The Semisimple Case
- A Note on Local Behavior of Multiple Eigenvalues
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Taxonomy of trust: categorizing P2P reputation systems
- A vector forward mode of automatic differentiation for generalized derivative evaluation
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
- First-order perturbation theory for eigenvalues and eigenvectors
- Numerical Nonsmooth Optimization
- Generalized Derivatives for Hybrid Systems
- Sensitivity and stability of ranking vectors
- Generalized derivatives of eigenvalues of a symmetric matrix
- From eigentrust to a trust-measuring algorithm in the max-plus algebra
This page was built for publication: Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094745)