1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/centrality.R
\name{authority_score}
\alias{authority.score}
\alias{authority_score}
\title{Kleinberg's authority centrality scores.}
\usage{
authority_score(graph, scale = TRUE, weights = NULL,
options = arpack_defaults)
}
\arguments{
\item{graph}{The input graph.}
\item{scale}{Logical scalar, whether to scale the result to have a maximum
score of one. If no scaling is used then the result vector has unit length
in the Euclidean norm.}
\item{weights}{Optional positive weight vector for calculating weighted
scores. If the graph has a \code{weight} edge attribute, then this is used
by default.}
\item{options}{A named list, to override some ARPACK options. See
\code{\link{arpack}} for details.}
}
\value{
A named list with members:
\item{vector}{The authority/hub scores of the vertices.}
\item{value}{The corresponding eigenvalue of the calculated
principal eigenvector.}
\item{options}{Some information about the ARPACK computation, it has
the same members as the \code{options} member returned
by \code{\link{arpack}}, see that for documentation.}
}
\description{
The authority scores of the vertices are defined as the principal
eigenvector of \eqn{A^T A}{t(A)*A}, where \eqn{A} is the adjacency
matrix of the graph.
}
\details{
For undirected matrices the adjacency matrix is symmetric and the
authority scores are the same as hub scores, see
\code{\link{hub_score}}.
}
\examples{
## An in-star
g <- make_star(10)
hub_score(g)$vector
authority_score(g)$vector
## A ring
g2 <- make_ring(10)
hub_score(g2)$vector
authority_score(g2)$vector
}
\references{
J. Kleinberg. Authoritative sources in a hyperlinked
environment. \emph{Proc. 9th ACM-SIAM Symposium on Discrete Algorithms},
1998. Extended version in \emph{Journal of the ACM} 46(1999). Also appears
as IBM Research Report RJ 10076, May 1997.
}
\seealso{
\code{\link{hub_score}}, \code{\link{eigen_centrality}} for
eigenvector centrality, \code{\link{page_rank}} for the Page Rank
scores. \code{\link{arpack}} for the underlining machinery of the
computation.
}
|
