Peripheral, central and coercive routes for promoting Enterprise Social Networks

Organisations employ Enterprise Social Networks (ESNs) (such as Yammer) expecting better intra-organisational communication and collaboration. However, ESNs are struggling to gain momentum and wide adoption among users. Promoting user participation is a challenge, particularly in relation to lurkers – the silent ESN members who do not contribute any content. Building on behaviour change research, we propose a three-route model consisting of the central, peripheral and coercive routes of influence that depict users’ cognitive strategies, and we examine how management interventions (e.g. sending promotional emails) impact users’ beliefs and (consequent) posting and lurking behaviours in ESNs. Furthermore, we identify users’ salient motivations to lurk or post. We employ a multi-method research design to conceptualise, operationalise and validate the research model. This study has implications for academics and practitioners regarding the nature, patterns and outcomes of management interventions in prompting ESN.

Do good things and talk about them : a theory of academics usage of enterprise social networks for impression management tactics

Enterprise social networks provide benefits especially for knowledge-intensive work as they enable communication, collaboration and knowledge exchange. These platforms should therefore lead to increased adoption and use by knowledge-intensive workers such as consultants or indeed researchers. Our interest is in ascertaining whether scientific researchers use enterprise social networks as part of their work practices. This focus is motivated by an apparent schism between a need for researchers to exchange knowledge and profile themselves, and the aversion to sharing breakthrough ideas and joining in an ever-increasing publishing and marketing game. We draw on research on academic work practices and impression management to develop a model of academics’ ESN usage for impression management tactics. We describe important constructs of our model, offer strategies for their operationalization and give an outlook to our ongoing empirical study of the use of an ESN platform by 20 schools across six faculties at an Australian university.

Second language social networks and communication-related acculturative stress: The role of interconnectedness

Although a substantial amount of cross-cultural psychology research has investigated acculturative stress in general, little attention has been devoted specifically to communication-related acculturative stress (CRAS). In line with the view that cross-cultural adaptation and second language (L2) learning are social and interpersonal phenomena, the present study examines the hypothesis that migrants’ L2 social network size and interconnectedness predict CRAS. The main idea underlying this hypothesis is that L2 social networks play an important role in fostering social and cultural aspects of communicative competence. Specifically, higher interconnectedness may reflect greater access to unmodified natural cultural representations and L2 communication practices, thus fostering communicative competence through observational learning. As such, structural aspects of migrants’ L2 social networks may be protective against acculturative stress arising from chronic communication difficulties. Results from a study of first generation migrant students (N = 100) support this idea by showing that both inclusiveness and density of the participants’ L2 network account for unique variance in CRAS but not in general acculturative stress. These results support the idea that research on cross-cultural adaptation would benefit from disentangling the various facets of acculturative stress and that the structure of migrants’ L2 network matters for language related outcomes. Finally, this study contributes to an emerging body of work that attempts to integrate cultural/cross-cultural research on acculturation and research on intercultural communication and second language learning.

Posters versus lurkers: Improving participation in enterprise social networks through promotional messages

Enterprise social networks (ESNs) often fail if there are few or no contributors of content. Promotional messages are among the common interventions used to improve participation. While most users only read others’ content (i.e. lurk), contributors who create content (i.e. post) account for only 1% of the users. Research on interventions to improve participation across dissimilar groups is scarce especially in work settings. We develop a model that examines four key motivations of posting and lurking. We employ the elaboration likelihood model to understand how promotional messages influence lurkers’ and posters’ beliefs and participation. We test our model with data collected from 366 members in two corporate Google⁺ communities in a large Australian retail organization. We find that posters and lurkers are motivated and hindered by different factors. Promotional messages do not – always – yield the hoped-for results among lurkers; however, they do make posters more enthusiastic to participate.

Using enterprise social networks as innovation platforms

Do enterprise social network platforms in an organization make the company more innovative? In theory, through communication, collaboration, and knowledge exchange, innovation ideas can easily be expressed, shared, and discussed with many partners in the organization. Yet, whether this guarantees innovation success remains to be seen. The authors studied how innovation ideas moved--or not--from an enterprise social network platform to regular innovation processes at a large Australian retailer. They found that the success of innovation ideas depends on how easily understandable the idea is on the platform, how long it has been discussed, and how powerful the social network participants are in the organization. These findings inform management strategies for the governance of enterprise social network use and the organizational innovation process.

Posters versus lurkers. Improving participation in enterprise social networks through management interventions

This thesis investigated the phenomenon of underutilised Enterprise social networks (ESNs). Guided by established theories, we identified key reasons that drive ESN members to either post (i.e., create content) or lurk (i.e., read others' content) and examined the influence of three management interventions - aim to boost participation - on lurkers' and posters' beliefs and participation. We test our model with data collected from 366 members in Google⁺ communities in a large Australian retail organization. We find that posters and lurkers are motivated and hindered by different factors. Moreover, management interventions do not – always – yield the hoped-for results among lurkers.

Privacy architectures in social networks’ state-of-the-art survey

The use of social networking has exploded, with millions of people using various web- and mobile-based services around the world. This increase in social networking use has led to user anxiety related to privacy and the unauthorised exposure of personal information. Large-scale sharing in virtual spaces means that researchers, designers and developers now need to re-consider the issues and challenges of maintaining privacy when using social networking services. This paper provides a comprehensive survey of the current state-of-the-art privacy in social networks for both desktop and mobile uses and devices from various architectural vantage points. The survey will assist researchers and analysts in academia and industry to move towards mitigating many of the privacy issues in social networks.

Social networks and use of social supports of minority elders in East Harlem

Considerable empirical research substantiates the importance of social networks on health and well-being in later life. A study of ethnic minority elders living in two low income public housing buildings in East Harlem was undertaken to gain an understanding of the relationship between their health status and social networks. Findings demonstrate that elders with supportive housing had better psychological outcomes and used significantly more informal supports when in need. However, elders with serious health problems had poorer outcomes regardless of their level of social support. This study highlights the potential of supportive living environments to foster social integration and to optimise formal and informal networks.

Social Networks and Everyday Practices in Russia

My doctoral dissertation in sociology and Russian studies, Social Networks and Everyday Practices in Russia, employs a "micro" or "grassroots" perspective on the transition. The study is a collection of articles detailing social networks in five different contexts. The first article examines Russian birthdays from a network perspective. The second takes a look at health care to see whether networks have become obsolete in a sector that is still overwhelmingly public, but increasingly being monetarised. The third article investigates neighbourhood relations. The fourth details relationships at work, particularly from the vantage point of internal migration. The fifth explores housing and the role of networks and money both in the Soviet and post-Soviet era. The study is based on qualitative social network and interview data gathered among three groups, teachers, doctors and factory workers, in St. Petersburg during 1993-2000. Methodologically it builds on a qualitative social network approach. The study adds a critical element to the discussion on networks in post-socialism. A considerable consensus exists that social networks were vital in state socialist societies and were used to bypass various difficulties caused by endemic shortages and bureaucratic rigidities, but a more debated issue has been their role in post-socialism. Some scholars have argued that the importance of networks has been dramatically reduced in the new market economy, whereas others have stressed their continuing importance. If a common denominator in both has been a focus on networks in relation to the past, a more overlooked aspect has been the question of inequality. To what extent is access to networks unequally distributed? What are the limits and consequences of networks, for those who have access, those outside networks or society at large? My study provides some evidence about inequalities. It shows that some groups are privileged over others, for instance, middle-class people in informal access to health care. Moreover, analysing the formation of networks sheds additional light on inequalities, as it highlights the importance of migration as a mechanism of inequality, for example. The five articles focus on how networks are actually used in everyday life. The article on health care, for instance, shows that personal connections are still important and popular in post-Soviet Russia, despite the growing importance of money and the emergence of "fee for service" medicine. Fifteen of twenty teachers were involved in informal medical exchange during a two-week study period, so that they used their networks to bypass the formal market mechanisms or official procedures. Medicines were obtained through personal connections because some were unavailable at local pharmacies or because these connections could provide medicines for a cheaper price or even for free. The article on neighbours shows that "mutual help" was the central feature of neighbouring, so that the exchange of goods, services and information covered almost half the contacts with neighbours reported. Neighbours did not provide merely small-scale help but were often exchange partners because they possessed important professional qualities, had access to workplace resources, or knew somebody useful. The article on the Russian work collective details workplace-related relationships in a tractor factory and shows that interaction with and assistance from one's co-workers remains important. The most interesting finding was that co-workers were even more important to those who had migrated to the city than to those who were born there, which is explained by the specifics of Soviet migration. As a result, the workplace heavily influenced or absorbed contexts for the worker migrants to establish relationships whereas many meeting-places commonly available in Western countries were largely absent or at least did not function as trusted public meeting places to initiate relationships. More results are to be found from my dissertation: Anna-Maria Salmi: Social Networks and Everyday Practices in Russia, Kikimora Publications, 2006, see www.kikimora-publications.com.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Determining Top K Nodes in Social Networks using the Shapley Value

In this paper, we consider the problem of selecting, for any given positive integer k, the top-k nodes in a social network, based on a certain measure appropriate for the social network. This problem is relevant in many settings such as analysis of co-authorship networks, diffusion of information, viral marketing, etc. However, in most situations, this problem turns out to be NP-hard. The existing approaches for solving this problem are based on approximation algorithms and assume that the objective function is sub-modular. In this paper, we propose a novel and intuitive algorithm based on the Shapley value, for efficiently computing an approximate solution to this problem. Our proposed algorithm does not use the sub-modularity of the underlying objective function and hence it is a general approach. We demonstrate the efficacy of the algorithm using a co-authorship data set from e-print arXiv (www.arxiv.org), having 8361 authors.

Incentive Compatible Influence Maximization in Social Networks with Application to Viral Marketing

Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A crucial assumption in all these studies is that the influence probabilities are known to the social planner. This assumption is unrealistic since the influence probabilities are usually private information of the individual agents and strategic agents may not reveal them truthfully. Moreover, the influence probabilities could vary significantly with the type of the information flowing in the network and the time at which the information is propagating in the network. In this paper, we use a mechanism design approach to elicit influence probabilities truthfully from the agents. Our main contribution is to design a scoring rule based mechanism in the context of the influencer-influencee model. In particular, we show the incentive compatibility of the mechanisms and propose a reverse weighted scoring rule based mechanism as an appropriate mechanism to use.

Influence limitation in multi-campaign social networks: A Shapley value based approach

We investigate the problem of influence limitation in the presence of competing campaigns in a social network. Given a negative campaign which starts propagating from a specified source and a positive/counter campaign that is initiated, after a certain time delay, to limit the the influence or spread of misinformation by the negative campaign, we are interested in finding the top k influential nodes at which the positive campaign may be triggered. This problem has numerous applications in situations such as limiting the propagation of rumor, arresting the spread of virus through inoculation, initiating a counter-campaign against malicious propaganda, etc. The influence function for the generic influence limitation problem is non-submodular. Restricted versions of the influence limitation problem, reported in the literature, assume submodularity of the influence function and do not capture the problem in a realistic setting. In this paper, we propose a novel computational approach for the influence limitation problem based on Shapley value, a solution concept in cooperative game theory. Our approach works equally effectively for both submodular and non-submodular influence functions. Experiments on standard real world social network datasets reveal that the proposed approach outperforms existing heuristics in the literature. As a non-trivial extension, we also address the problem of influence limitation in the presence of multiple competing campaigns.