2011
DOI: 10.1002/net.20442
|View full text |Cite
|
Sign up to set email alerts
|

A note on a generalization of eigenvector centrality for bipartite graphs and applications

Abstract: Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need to design rating systems for bipartite graph models of time-sensitive and other processes. The linear algebra connection and some applications are described.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…The eigenvector centrality of a node is proportional to the sum of centralities of the nodes it is adjacent to. Bipartite eigenvector centrality is further reviewed by Daugulis [40].…”
Section: Bipartite Graphsmentioning
confidence: 99%
“…The eigenvector centrality of a node is proportional to the sum of centralities of the nodes it is adjacent to. Bipartite eigenvector centrality is further reviewed by Daugulis [40].…”
Section: Bipartite Graphsmentioning
confidence: 99%
“…In most cases, the more important the task is, the more it can highlight the value of the worker from the side. Eigenvector centrality has been widely used in webpage ranking for search engine [45] and other rating systems [20], [45], [46]. Recently, Daugulis proposed a generalized eigenvector centrality to rank the nodes in the bipartite graph [20].…”
Section: ) Centrality-based Attackmentioning
confidence: 99%
“…Eigenvector centrality has been widely used in webpage ranking for search engine [45] and other rating systems [20], [45], [46]. Recently, Daugulis proposed a generalized eigenvector centrality to rank the nodes in the bipartite graph [20]. If we define rating vectors x and y for tasks and workers, respectively, and also an adjacency matrix representing the allocation of tasks to workers, the following assumptions are then made to create a rating system [20]:…”
Section: ) Centrality-based Attackmentioning
confidence: 99%
See 2 more Smart Citations