143 research outputs found
Applications of Structural Balance in Signed Social Networks
We present measures, models and link prediction algorithms based on the
structural balance in signed social networks. Certain social networks contain,
in addition to the usual 'friend' links, 'enemy' links. These networks are
called signed social networks. A classical and major concept for signed social
networks is that of structural balance, i.e., the tendency of triangles to be
'balanced' towards including an even number of negative edges, such as
friend-friend-friend and friend-enemy-enemy triangles. In this article, we
introduce several new signed network analysis methods that exploit structural
balance for measuring partial balance, for finding communities of people based
on balance, for drawing signed social networks, and for solving the problem of
link prediction. Notably, the introduced methods are based on the signed graph
Laplacian and on the concept of signed resistance distances. We evaluate our
methods on a collection of four signed social network datasets.Comment: 37 page
The Problem of Action at a Distance in Networks and the Emergence of Preferential Attachment from Triadic Closure
In this paper, we characterise the notion of preferential attachment in
networks as action at a distance, and argue that it can only be an emergent
phenomenon -- the actual mechanism by which networks grow always being the
closing of triangles. After a review of the concepts of triangle closing and
preferential attachment, we present our argument, as well as a simplified model
in which preferential attachment can be derived mathematically from triangle
closing. Additionally, we perform experiments on synthetic graphs to
demonstrate the emergence of preferential attachment in graph growth models
based only on triangle closing.Comment: 13 pages, three figure
- …