Theory of Complex Networks
Tutorial 5
23.Degree distributions for canonical graphssolution
Calculate the degree distributions
or for directed graphs for the $N$-node graphs with the following adjacency matrices (check carefully whether they are directed or nondirected, and use the correct degree distribution definition in each case): (a) for , and . (b) for all (c) for all (d) if either or ; otherwise (e) for all , for all other .24.Joint degree distribution of connected node pairssolution
Calculate the joint distribution of degrees of connected node pairs
for the middle graph and right graph in question 1 of the first tutorial. For the middle graph, compute the marginal and compare your result with the degree distribution for this graph.25.Degree assortativity of sample graphssolution
Compute the assortativity
for the middle graph and right graph in question 1 of the first tutorial. Relate the obtained numbers to the graph structure shown in question 1.26.Marginals of joint degree distribution on directed graphssolution
Let
be the joint distribution of degrees and at the end points of a directed edge. Let be the left marginal of and let be its marginal. Show that and that .
Solutions
23.Degree distributions for canonical graphs
No solution yet.
24.Joint degree distribution of connected node pairs
No solution yet.
25.Degree assortativity of sample graphs
No solution yet.
26.Marginals of joint degree distribution on directed graphs
No solution yet.