From: Optimized relativity search: node reduction in personalized page rank estimation for large graphs
Notation | Description |
---|---|
N | Number of nodes in the graph |
K | Number of nodes after reduction |
M | Number of iteration for a certain node |
V, E | Presentation of nodes and edge |
{w, u}, U | Designated node, Set of u’s |
α, (1 − α) | Transition, Teleportation probability |
r, P′ | Probability, contribution vector |
q | Stochastic matrix |
d _{ in } , d _{ out } | Incoming and outgoing edges |
A, D, C | Adjacency, diagonal, and covariance matrices, respectively |
δ | Given threshold |
є | Error parameter |
t | Iteration number |
x | Estimated number for random walk |
R | Reduced space matrix |
C | Data matrix |