Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem

DOI10.1137/21M146884XMaRDI QIDQ6094745zbMATH OpenFDO

Authors Peter Stechlinski

Publication date 14 September 2023

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

nonsmooth analysispeer-to-peer networksgeneralized derivativesgraph centralityeigenvalue and eigenvector sensitivitieseigentrust

Mathematics Subject Classification ID

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)

Recommendations

• From eigentrust to a trust-measuring algorithm in the max-plus algebra
• Dirichlet PageRank and ranking algorithms based on trust and distrust
• A distributed algorithm for personalized trust evaluation in social networks
• Dirichlet PageRank and trust-based ranking algorithms

Cites work

• scientific article; zbMATH DE number 3846333 (Why is no real title available?)
• scientific article; zbMATH DE number 4002281 (Why is no real title available?)
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Note on Local Behavior of Multiple Eigenvalues
• A nonsmooth version of Newton's method
• A vector forward mode of automatic differentiation for generalized derivative evaluation
• An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
• Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
• Combinatorial matrix theory
• Computation of Derivatives of Repeated Eigenvalues and the Corresponding Eigenvectors of Symmetric Matrix Pencils
• Computationally relevant generalized derivatives: theory, evaluation and applications
• Derivatives and Perturbations of Eigenvectors
• Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• First-order perturbation theory for eigenvalues and eigenvectors
• From eigentrust to a trust-measuring algorithm in the max-plus algebra
• Generalized Derivatives for Hybrid Systems
• Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides
• Generalized derivatives of eigenvalues of a symmetric matrix
• Introduction to Piecewise Differentiable Equations
• Introduction to nonsmooth optimization. Theory, practice and software
• Lexicographic differentiation of nonsmooth functions
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Methods of descent for nondifferentiable optimization
• Multiple eigenvalue sensitivity analysis
• Numerical Nonsmooth Optimization
• Perturbation Theory for Analytic Matrix Functions: The Semisimple Case
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Sensitivity and stability of ranking vectors
• Taxonomy of trust: categorizing P2P reputation systems

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)