This sets of three graphs compare tie weight distribution in the three one-mode networks of multiple attendance at the meetings of the Shanghai Rotary Club under President Petit's (1919-20), Fitch's (1930-1) and Harkson's (1938-9) terms. In this network, nodes represent events (club meetings), whereas edges represents the attendees they have in common. Any edge links two events who share participants. The absence of ties reflects events that have no participants in common. Tie weight expresses the number of multiple participants (using the “sum” method). The original datasets and the resulting graphs are available in the "Tables" and "Trees" section, respectively. We used the R package "dplyr" to make these graphs. 

Unsurprisingly, there is a reversely proportional relation between tie weight (number of shared participants) and number of dyads (events that share participants). Those who shared many participants are the least frequent. Conversely, events that have only one participant in common are the most frequent.