Bipartite graphs can be used to capture social networks through event participation. By letting one set of vertices be participants and the other set be events, each edge represents an individual participating in an event. These bipartite graphs can be projected into a weighted graph by multiplying the bipartite adjacency matrix by its transpose. In the projection, an edge between two individuals represents the number of times they participated in the same event. We can now ask, how many times do two people have to participate in events together before we can assume they have some sort of relationship? We will discuss ways to decide if an edge weight is strong enough and deduce friendship ties.