Child pages
  • Degree & Strength

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migrated to Confluence 4.0

...

This algorithm only accepts networks with undirected edges. It cannot work with directed edges. This algorithm also treats unweighted networks as networks whose edge weights are all 1.

Wiki MarkupFor each node _node\[i\]_, this algorithm calculates the total node degree (_degree(node\[i\])_) and the total node strength (_strength(node\[i\])_), where:

  • Wiki Markup_degree(node\[i\])_ = total degree of _node\[i\]_ = number of edges _node\[i\]_ is connected to Wiki Markup
  • _strength(node\[i\])_ = the sum of the weights of all of the edges _node\[i\]_ is connected to

Given the nature of the node strength, if the input network is unweighted, the node degree will always equal the node strength for all nodes.

...