Life events and social support among patients with major depressive disorder

The study is part of a research project of 269 psychiatric patients with major depression, Vantaa Depression Study, in the Department of Mental Health and Alcohol Research of the National Public Health Institute and the Department of Psychiatry of the Peijas Medical Care District. The aim was to study at the onset of MDE psychosocial differences in subgroups of patients and clustering of events into time before depression and its prodromal phase, to study whether more severe life events and less social support predict poorer outcome in all patients, but most among those currently in partial remission, whether social support declines as a consequence of time spent in MDE, is sensitive to improvement, and whether social support is influenced by neuroticism and extraversion. After screening, a semistructured interview (SCAN, version 2.0) was used for the presence of DSM-IV MDE, and other psychiatric diagnoses. Life events and social support were studied with semistructured methods (IRLE, Paykel 1983; IMSR, Brugha et al. 1987), perceived social support and neuroticism/extraversion with questionnaires (PSSS-R, Blumenthal et al. 1987; EPI, Eysenck and Eysenck 1964) at baseline, 6 and 18 months. At the onset of depression life events were common. No major differences between subgroups of patients were found; the younger had more events, whereas those with comorbid alcoholism and personality disorders perceived less support. Although events were distributed evenly between the time before depression, the prodromal phase and the index MDE, two thirds of the patients attributed their depression to some life event. Adversities and poor perceived support influenced the outcome of all psychiatric patients, most in the subgroup of full remission. In the partial remission group, the impact of severe events and in the MDE, perceived support was important. Low objective and subjective support were predicted by longer time spent in MDE. Along with improvement subjective support improved. Neuroticism and extraversion were associated with the size of social network and perceived support and predicted change of perceived support. In conclusion, adversities were common in all phases of depression. They may thus have many roles; before depression they may precipitate it, in the prodromal phase worsen symptoms, and during the MDE, the outcome of depression. Patients often attributed their depression to a life event. Psychosocial subgroup differences were quite small. Perceived support predicted the outcome of depression, and time spent in MDE objective and subjective support. Neuroticism and extraversion may modify the level and change particularly in perceived support, thereby indirectly effecting vulnerability to depression.

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.

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.

Multidimensionality of Actors in Business Networks: The Influence of Social Action in Pharmacy Networks in Finland

In the markets-as-networks approach business networks are conceived as dynamic actor structures, giving focus to exchange relationships and actors’ capabilities to control and co-ordinate activities and resources. Researchers have shared an understanding that actors’ actions are crucial for the development of business networks and for network dynamics. However, researchers have mainly studied firms as business actors and excluded individuals, although both firms and individuals can be seen as business actors. This focus on firms as business actors has resulted in a paucity of research on human action and the exchange of intangible resources in business networks, e.g. social exchange between individuals in social networks. Consequently, the current conception of business networks fails to appreciate the richness of business actors, the human character of business action and the import of social action in business networks. The central assumption in this study is that business actors are multidimensional and that their specific constitution in any given situation is determined by human interaction in social networks. Multidimensionality is presented as a concept for exploring how business actors act in different situations and how actors simultaneously manage multiple identities: individual, organisational, professional, business and network identities. The study presents a model that describes the multidimensionality of actors in business networks and conceptualises the connection between social exchange and human action in business networks. Empirically the study explores the change that has taken place in pharmaceutical retailing in Finland during recent years. The phenomenon of emerging pharmacy networks is highly contemporary in the Nordic countries, where the traditional license-based pharmacy business is changing. The study analyses the development of two Finnish pharmacy chains, one integrated and one voluntary chain, and the network structures and dynamics in them. Social Network Analysis is applied to explore the social structures within the pharmacy networks. The study shows that emerging pharmacy networks are multifaceted phenomena where political, economic, social, cultural, and historical elements together contribute to the observed changes. Individuals have always been strongly present in the pharmacy business and the development of pharmacy networks provides an interesting example of human actors’ influence in the development of business networks. The dynamics or forces driving the network development can be linked to actors’ own economic and social motives for developing the business. The study highlights the central role of individuals and social networks in the development of the two studied pharmacy networks. The relation between individuals and social networks is reciprocal. The social context of every individual enables multidimensional business actors. The mix of various identities, both individual and collective identities, is an important part of network dynamics. Social networks in pharmacy networks create a platform for exchange and social action, and social networks enable and support business network development.

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.

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.

Method of designing an access mechanism for social networks

The rapid development of communication and networking has lessened geographical boundaries among actors in social networks. In social networks, actors often want to access databases depending upon their access rights, privacy, context, privileges, etc. Managing and handling knowledge based access of actors is complex and hard for which broad range of technologies need to be called. Access based on dynamic access rights and circumstances of actors impose major tasks on access systems. In this paper, we present an Access Mechanism for Social Networks (AMSN) to render access to actors over databases taking privacy and status of actors into consideration. The designed AMSN model is tested over an Agriculture Social Network (ASN) which utilises distinct access rights and privileges of actors related to the agriculture occupation, and provides access to actors over databases.

Scalable Preference Aggregation in Social Networks

In social choice theory, preference aggregation refers to computing an aggregate preference over a set of alternatives given individual preferences of all the agents. In real-world scenarios, it may not be feasible to gather preferences from all the agents. Moreover, determining the aggregate preference is computationally intensive. In this paper, we show that the aggregate preference of the agents in a social network can be computed efficiently and with sufficient accuracy using preferences elicited from a small subset of critical nodes in the network. Our methodology uses a model developed based on real-world data obtained using a survey on human subjects, and exploits network structure and homophily of relationships. Our approach guarantees good performance for aggregation rules that satisfy a property which we call expected weak insensitivity. We demonstrate empirically that many practically relevant aggregation rules satisfy this property. We also show that two natural objective functions in this context satisfy certain properties, which makes our methodology attractive for scalable preference aggregation over large scale social networks. We conclude that our approach is superior to random polling while aggregating preferences related to individualistic metrics, whereas random polling is acceptable in the case of social metrics.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

A Multi-phase Approach for Improving Information Diffusion in Social Networks

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate objective function for two-phase influence maximization under the independent cascade model, investigate its properties, and propose algorithms for determining the seed nodes in the two phases. We also study the problem of determining an optimal budget-split and delay between the two phases.

Accelerating Information Diffusion in Social Networks Under the Susceptible-Infected-Susceptible Epidemic Model

Standard Susceptible-Infected-Susceptible (SIS) epidemic models assume that a message spreads from the infected to the susceptible nodes due to only susceptible-infected epidemic contact. We modify the standard SIS epidemic model to include direct recruitment of susceptible individuals to the infected class at a constant rate (independent of epidemic contacts), to accelerate information spreading in a social network. Such recruitment can be carried out by placing advertisements in the media. We provide a closed form analytical solution for system evolution in the proposed model and use it to study campaigning in two different scenarios. In the first, the net cost function is a linear combination of the reward due to extent of information diffusion and the cost due to application of control. In the second, the campaign budget is fixed. Results reveal the effectiveness of the proposed system in accelerating and improving the extent of information diffusion. Our work is useful for devising effective strategies for product marketing and political/social-awareness/crowd-funding campaigns that target individuals in a social network.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Turnout Intention and Social Networks

How can networking affect the turnout in an election? We present a simple model to explain turnout as a result of a dynamic process of formation of the intention to vote within Erdös-Renyi random networks. Citizens have fixed preferences for one of two parties and are embedded in a given social network. They decide whether or not to vote on the basis of the attitude of their immediate contacts. They may simply follow the behavior of the majority (followers) or make an adaptive local calculus of voting (Downsian behavior). So they either have the intention of voting when the majority of their neighbors are willing to vote too, or they vote when they perceive in their social neighborhood that elections are "close". We study the long run average turnout, interpreted as the actual turnout observed in an election. Depending on the combination of values of the two key parameters, the average connectivity and the probability of behaving as a follower or in a Downsian fashion, the system exhibits monostability (zero turnout), bistability (zero turnout and either moderate or high turnout) or tristability (zero, moderate and high turnout). This means, in particular, that for a wide range of values of both parameters, we obtain realistic turnout rates, i.e. between 50% and 90%.

Altruism with Social Roots: An Emerging Literature

Revised: 2007-01.-- Published as an article in: Revista Desarrollo y Sociedad (2006), Semestre II, pp. 245-260.