Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem (Q6094745)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem |
scientific article; zbMATH DE number 7737639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem |
scientific article; zbMATH DE number 7737639 |
Statements
Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem (English)
0 references
14 September 2023
0 references
eigentrust
0 references
graph centrality
0 references
peer-to-peer networks
0 references
eigenvalue and eigenvector sensitivities
0 references
generalized derivatives
0 references
nonsmooth analysis
0 references
0 references
0 references
0 references
0 references
0.711300790309906
0 references
0.6619783043861389
0 references
0.6562552452087402
0 references
0.6504647731781006
0 references
