Welcome to the repository of Accelerating Personalized PageRank Vector Computation! We build this repository to make our proposed algorithm publicly available and reproduce main experimental results shown in our KDD2023 paper.

We provide DBLP and Web-Stanford in ./dataset/.
Products is available on https://ogb.stanford.edu/docs/nodeprop/#ogbn-products. The rest datasets are available on https://snap.stanford.edu/data/.

Create a virtual environment and install the dependencies via the following command:

conda env create -f environment.yml

To draw Figure2, Figure 3 and Figure 6, run the following code:

cd plots
python fig2.py
python fig3.py
python fig6.py

First compute the ppr vectors, the time cost and the operation cost of each dataset:

cd plots
python cal_ppr.py -d dblp -a .2

The above code computes the ppr vectors of 50 random selected nodes in the dblp dataset when $\alpha$=0.2. To draw the plot, you should run the code on the total 6 datasets. Then run the following code:

python fig45.py

We provide a demo to show how to use our proposed algorithms.

python demo.py

To use our algorithms on your own graph, you should provide the adjacent matrix of the graph in the form of Compressed Sparse Row matrix and ensure that there is no self-loop in the graph, and each node has at least 1 out-degree.