I. Sugesting Similar Papers

A citation network is a directed network where the vertices are academic papers and there is a directed edge from paper A to paper B if paper A cites paper B in its bibliography. Google Scholar performs automated citation indexing and has a useful feature that allows users to find similar papers. In the following, we analyze two approaches for measuring similarity between papers.

Part (a): Co-citation network

Two papers are said to be cocited if they are both cited by the same third paper. The edge weights in the cocitation network correspond to the number of cocitations. In this part, we will discover how to compute the (weighted) adjacency matrix of the cocitation network from the adjacency matrix of the citation network.

Part a) Question 1

Let's analyze the given algorithm step by step to determine if it generates the cocitation weighted adjacency matrix and to find its time complexity.

Algorithm Analysis

  1. Initial Setup:
  2. Iterating through rows of A:

1. Does this generate the cocitation weighted adjacency matrix?

Cocitation Matrix Definition:

Analysis: