Message-ID: <1977734816.1535.1594862329676.JavaMail.confluence@wiki.cns.iu.edu> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_1534_703245133.1594862329675" ------=_Part_1534_703245133.1594862329675 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html Arc Reciprocity

# Arc Reciprocity

###### Description
=20

In a directed network, two nodes (A, B) are said to have a reci= procal relationship if there exists an edge from A to B and from B to A. Th= e reciprocity is the ratio of reciprocal relationships in the network in to= the total number of relationships (reciprocal or otherwise) in the network= .

=20

A dyad is defined as any = pair of actors (nodes) (A, B). In a directed network there are three possib= le kinds of dyads, no tie (link), one likes the other but not vice versa (A= B or BA exists, but not both), or both like the other (AB and BA exist). Th= e last one corresponds to a reciprocal relation and a reciprocated tie.

=20

The prevalence of recipro= city is given by the ratio of number of ties involved in reciprocal relatio= ns to the total number of ties present in the network.

=20
###### Usage Hints
=20

Algorithm must be applied to directed networks. Self-loops are ignored i= n the calculation.

=20

This is global calculation for the input network, and as such the result= s are simply reported on the Console window.

=20
=20
=20
• =20
=20
###### References
=20

Hanneman, Robert A. and Mark Riddle. 2005. Introduction to social networ= k methods. Riverside, CA: University of California, Riverside.

=20

http://faculty.ucr.edu/~hanneman/nettext/

= =20