This algorithm only accepts networks with undirected edges. It cannot wo= rk with directed edges.

=20This algorithm is mislabeled. It calculates the total edge degree *de=
gree(edge[s, t])* as a function of total node degree (*degree(node[s=
])* * *degree(node[t])*), where:

- =20
*degree(edge[s, t])*=3D*degree(node[s])***degree(n= ode[t])*=20
*degree(node[s])*=3D total degree of*node[s]*=3D numbe= r of edges*node[s]*is connected to =20
*degree(node[t])*=3D total degree of*node[t]*=3D numbe= r of edges*node[t]*is connected to =20

Even though this algorithm calculates the total node degree internally, =
it does not annotate the output network with it. The output of this algorit=
hm is the original network, but annotated with the calculated edge degree (=
edge) attribute, *endpointdegree*.

In addition to the annotated network, there are two other output files t= hat this algorithm produces:

=20- =20
*Average Weight as a Function of End-Point-Degree with Linear Binnin= g*=20- =20
- Again, this is mislabeled. This file contains the center values of the = linearly-binned total edge degrees. =20

=20
*Average Weight as a Function of End-Point-Degree with Logarithmic B= inning*=20- =20
- This file contains the center values of the logarithmically-binned tota= l edge degrees. =20

=20

- =20
- Node Degree =20
- Source Code =20

This algorithm was written by Duygu Balcan and integrated by Russell Duh= on.