Swim Friendship Network

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)

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Swim Friendship Network"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Swim Friendship Network", All]["Summary"]
Out[2]=

Basic Applications

Find the communities in a friendship network of the swim team:

In[3]:=
g = ResourceData["Swim Friendship Network"];
In[4]:=
communities = FindGraphCommunities[g, Method -> "Hierarchical"]
Out[4]=

Predict the split of the network in the case of a conflict:

In[5]:=
HighlightGraph[g, Subgraph[g, #] & /@ communities, GraphHighlightStyle -> "DehighlightHide"]
Out[5]=

Find the most influential member in the friendship network by centrality:

In[6]:=
Commonest[
 First[Part[VertexList[g], Ordering[#[g], All, Greater]]] & /@ {BetweennessCentrality, ClosenessCentrality, DegreeCentrality, EccentricityCentrality, EigenvectorCentrality, RadialityCentrality, StatusCentrality} ]
Out[6]=

Wolfram Research, "Swim Friendship Network" from the Wolfram Data Repository (2019)  

Data Resource History

Publisher Information