arXiv:1107.3231cs.SI
Triangles to Capture Social Cohesion
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Although community detection has drawn tremendous amount of attention across the sciences in the past decades, no formal consensus has been reached on the very nature of what qualifies a community as such. In this article we take an orthogonal approach by introducing a novel point of view to the problem of overlapping communities. Instead of quantifying the quality of a set of communities, we choose to focus on the intrinsic community-ness of one given set of nodes. To do so, we propose a general metric on graphs, the cohesion, based on counting triangles and inspired by well established sociological considerations. The model has been validated through a large-scale online experiment called Fellows in which users were able to compute their social groups on Face- book and rate the quality of the obtained groups. By observing those ratings in relation to the cohesion we assess that the cohesion is a strong indicator of users subjective perception of the community-ness of a set of people.
I was not aware of this xkcd comic, funny how things seem to pop out. My inspiration was more in the line of Sankey diagrams. Among others, the famous map of Napoleon's invasion of Russia by Minard (http://en.wikipedia.org/wiki/File:Minard.png). I've called this representation a…
friggeriView on HNParent context
Thanks, the algorithm is a heuristic which optimize a quantity I've called social cohesion (http://arxiv.org/pdf/1107.3231.pdf), the article presenting the algorithm itself is currently under review, but basically: first it computes the best possible group for selected edges in…
friggeriView on HNParent context