Theory of Complex Networks
Tutorial 3
13.Closeness and betweenness of nodes 2 and 3 in two tutorial graphssolvedsolution
Calculate the closeness centrality and the betweenness centrality of nodes
and in the second graph and the third graph of the first tutorial.14.Closeness centralities of the two ends of a tree edgesolvedsolution
Consider the tree in the figure. The edge connecting node 1 to node 2 divides the tree into two disjoint regions containing
and nodes, respectively (with ).Fig. 1. A tree containing an edge connecting two disjoint regions of size and .Show that the closeness centrality
of node 1 is related to the closeness centrality of node 2 by15.Betweenness centrality of a tree node whose removal splits the treesolution
Consider a tree of size
. Suppose there exists a node of degree , say node 1, such that its removal divides the tree into isolated trees of sizes ( ). Show that the betweenness centrality of this node is Use this result to derive the betweenness centrality of the nodes in the second graph of Tutorial 1.16.Adjacency spectrum and eigenvector centrality of the star graphsolution
Calculate the adjacency matrix eigenvalue spectrum
of the middle graph in exercise 1 of the first tutorial. Determine the eigenvector centrality of all the nodes in the middle graph.