Self-presentation and emotional contagion on Facebook: new experimental measures of profiles' emotional coherence

Social Networks allow users to self-present by sharing personal contents with others which may add comments. Recent studies highlighted how the emotions expressed in a post affect others' posts, eliciting a congruent emotion. So far, no studies have yet investigated the emotional coherence between wall posts and its comments. This research evaluated posts and comments mood of Facebook profiles, analyzing their linguistic features, and a measure to assess an excessive self-presentation was introduced. Two new experimental measures were built, describing the emotional loading (positive and negative) of posts and comments, and the mood correspondence between them was evaluated. The profiles "empathy", the mood coherence between post and comments, was used to investigate the relation between an excessive self-presentation and the emotional coherence of a profile. Participants publish a higher average number of posts with positive mood. To publish an emotional post corresponds to get more likes, comments and receive a coherent mood of comments, confirming the emotional contagion effect reported in literature. Finally, the more empathetic profiles are characterized by an excessive self-presentation, having more posts, and receiving more comments and likes. To publish emotional contents appears to be functional to receive more comments and likes, fulfilling needs of attention-seeking.Comment: Submitted to Complexit

Dynamic Rank Maximal Matchings

We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A U P,E), where A denotes a set of applicants, P is a set of posts, and there are ranks on edges which denote the preferences of applicants over posts. A matching M in G is called rank-maximal if it matches the maximum number of applicants to their rank 1 posts, subject to this the maximum number of applicants to their rank 2 posts, and so on. We consider this problem in a dynamic setting, where vertices and edges can be added and deleted at any point. Let n and m be the number of vertices and edges in an instance G, and r be the maximum rank used by any rank-maximal matching in G. We give a simple O(r(m+n))-time algorithm to update an existing rank-maximal matching under each of these changes. When r = o(n), this is faster than recomputing a rank-maximal matching completely using a known algorithm like that of Irving et al., which takes time O(min((r + n, r*sqrt(n))m)