Question No: 01 Consider the node classification problem in graphs, where a common scenario is that a few nodes are labelled and the aim is to assign labels to some of the unlabelled nodes. Label 1 V 1) 11) 863 V 110 V3 Figure for Node Classification Label 2 Label propagation methods often use random walks to assign labels to unlabelled nodes. Suppose we wish to label node Vi in the graph shown in Figure. Assume a random walk is started from node Vi and terminated (5 marks) once a labelled node is reached. What is the probability that a labelled node is reached in 4 hops or less? Calculate the probabilities of reaching a node with Label 1 (blue) in 4 hops or less.