Motivated by applications that arise in online social media and collaboration networks, there has been a lot of work on community-search.  In this class of problems, the goal is to find a subgraph that satisfies a certain connectivity requirement and contains a given collection of seed nodes.#R##N##R##N#In this paper, we extend the community-search problem by associating each individual with a profile. The profile is a numeric score that quantifies the position of an individual with respect to a topic. We adopt a model where each individual starts with a latent profile and arrives to a conformed profile through a dynamic conformation process, which takes into account the individual's social interaction and the tendency to conform with one's social environment.  In this framework, social tension arises from the differences between the conformed profiles of neighboring individuals as well as from the differences between individuals' conformed and latent profiles.#R##N##R##N#Given a network of individuals, their latent profiles and this conformation process, we extend the community-search problem by requiring the output subgraphs to have low social tension.  From the technical point of view, we study the complexity of this problem and propose algorithms for solving it effectively.  Our experimental evaluation in a number of social networks reveals the efficacy and efficiency of our methods.
['Esther Galbrun', 'Behzad Golshan', 'Aristides Gionis', 'Evimaria Terzi']
Finding low-tension communities