Theory of Complex Networks

Tutorial 5

4 problems · 0 solved

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

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

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

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

  1. 23.Degree distributions for canonical graphs

    No solution yet.

  2. 24.Joint degree distribution of connected node pairs

    No solution yet.

  3. 25.Degree assortativity of sample graphs

    No solution yet.

  4. 26.Marginals of joint degree distribution on directed graphs

    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