Wolfram Data Repository
Immediate Computable Access to Curated Contributed Data
Social network of friendship in a swimming team
A social network of a school swimming team. Two persons have a tie if they are friends.
(9 vertices, 13 edges)
Retrieve the graph:
In[1]:= | ![]() |
Out[1]= | ![]() |
Summary properties:
In[2]:= | ![]() |
Out[2]= | ![]() |
Find the communities in a friendship network of the swim team:
In[3]:= | ![]() |
In[4]:= | ![]() |
Out[4]= | ![]() |
Predict the split of the network in the case of a conflict:
In[5]:= | ![]() |
Out[5]= | ![]() |
Find the most influential member in the friendship network by centrality:
In[6]:= | ![]() |
Out[6]= | ![]() |
Wolfram Research, "Swim Friendship Network" from the Wolfram Data Repository (2019)