Theory of Complex Networks

Tutorial 3

4 problems · 2 solved

  1. 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.

  2. 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 ).

    A tree containing an edge connecting two disjoint regions of size \(N_1\) and \(N_2\).
    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 by

  3. 15.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.

  4. 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.

Solutions

  1. 13.Closeness and betweenness of nodes 2 and 3 in two tutorial graphs

  2. 14.Closeness centralities of the two ends of a tree edge

  3. 15.Betweenness centrality of a tree node whose removal splits the tree

    No solution yet.

  4. 16.Adjacency spectrum and eigenvector centrality of the star graph

    No solution yet.

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card