Hi Hannah,
here some clarifications. Let's assume an indirected network with 15
nodes and 12 edges (links). Consider a node A with 3 links in this
network:
(1) degree = a node's absolute number of connections. In our example
d(A) = 3.
(2) degree (std) = a node's degree value divided by network size minus
one (1). In our example the degree (std) = 3 / (15-1) = 3 / 14 ~ 0.214.
(3) degree (%) = the share (%) of a node's links (=degree) of all links
in the graph. In aN indirected graph this is (d / 2L) * 100. In our
example this would be: (3 / 2*12) * 100 = (3 / 24) * 100 = 12.5.
See also:
https://jacobtnyoung.github.io/snaca-r/snaca-r-degree-centrality.html
HTH,
Kimmo
to, 2025-03-13 kello 09:28 -0700, Hannah Love kirjoitti:
> Hello,
>
> I'm writing up some results for an article and I wanted to make sure
> I had
> the correct description for "degree." The page seems to be
> blank:
https://visone.ethz.ch/wiki/index.php/Degree
> I'm curious about:
>
> - Degree
> - Degree (%)
> - Degree (std)