Information Filtering on Coupled Social Networks

In this paper, based on the coupled social networks (CSN), we propose a hybrid algorithm to nonlinearly integrate both social and behavior information of online users. Filtering algorithm, based on the coupled social networks, considers the effects of both social similarity and personalized preference. Experimental results based on two real datasets, Epinions and Friendfeed, show that the hybrid pattern can not only provide more accurate recommendations, but also enlarge the recommendation coverage while adopting global metric. Further empirical analyses demonstrate that the mutual reinforcement and rich-club phenomenon can also be found in coupled social networks where the identical individuals occupy the core position of the online system. This work may shed some light on the in-depth understanding of the structure and function of coupled social networks.     

Information Flow Analysis of Interactome Networks

Recent studies of cellular networks have revealed modular organizations of genes and proteins. For example, in interactome networks, a module refers to a group of interacting proteins that form molecular complexes and/or biochemical pathways and together mediate a biological process. However, it is still poorly understood how biological information is transmitted between different modules. We have developed information flow analysis, a new computational approach that identifies proteins central to the transmission of biological information throughout the network. In the information flow analysis, we represent an interactome network as an electrical circuit, where interactions are modeled as resistors and proteins as interconnecting junctions. Construing the propagation of biological signals as flow of electrical current, our method calculates an information flow score for every protein. Unlike previous metrics of network centrality such as degree or betweenness that only consider topological features, our approach incorporates confidence scores of protein–protein interactions and automatically considers all possible paths in a network when evaluating the importance of each protein. We apply our method to the interactome networks of Saccharomyces cerevisiae and Caenorhabditis elegans. We find that the likelihood of observing lethality and pleiotropy when a protein is eliminated is positively correlated with the protein's information flow score. Even among proteins of low degree or low betweenness, high information scores serve as a strong predictor of loss-of-function lethality or pleiotropy. The correlation between information flow scores and phenotypes supports our hypothesis that the proteins of high information flow reside in central positions in interactome networks. We also show that the ranks of information flow scores are more consistent than that of betweenness when a large amount of noisy data is added to an interactome. Finally, we combine gene expression data with interaction data in C. elegans and construct an interactome network for muscle-specific genes. We find that genes that rank high in terms of information flow in the muscle interactome network but not in the entire network tend to play important roles in muscle function. This framework for studying tissue-specific networks by the information flow model can be applied to other tissues and other organisms as well.     

Recovery of Dynamics and Function in Spiking Neural Networks with Closed-Loop Control

There is a growing interest in developing novel brain stimulation methods to control disease-related aberrant neural activity and to address basic neuroscience questions. Conventional methods for manipulating brain activity rely on open-loop approaches that usually lead to excessive stimulation and, crucially, do not restore the original computations performed by the network. Thus, they are often accompanied by undesired side-effects. Here, we introduce delayed feedback control (DFC), a conceptually simple but effective method, to control pathological oscillations in spiking neural networks (SNNs). Using mathematical analysis and numerical simulations we show that DFC can restore a wide range of aberrant network dynamics either by suppressing or enhancing synchronous irregular activity. Importantly, DFC, besides steering the system back to a healthy state, also recovers the computations performed by the underlying network. Finally, using our theory we identify the role of single neuron and synapse properties in determining the stability of the closed-loop system.     

Social Information Embedded in Vocalizations Induces Neurogenomic and Behavioral Responses

Social cues facilitate relationships within communities. Zebra finches form long-term stable mate pairs and produce offspring within a multi-family, multi-generational community that can include hundreds of birds. Males use song to communicate in this complex environment. Males sing as part of their courtship display but also abundantly throughout each day, suggesting a role for their vocal signature outside of a reproductive context. One advantage of a vocal social cue is that it can be exchanged when birds are out of visual contact, as regularly occurs in a zebra finch community. Previous works have demonstrated that females hearing song are affected by their social relationship to the bird singing it, and the immediate social context. Here, we probed the question of whether or not the song itself carried social information, as would be expected from the situations when males sing outside of view of the female. We quantified behavioral and neurogenomic responses to two songs we predicted would have distinct “attractive” qualities in adult females housed in either mixed sex or female-only social communities. Our results show that only mixed sex-housed females show distinctive behavioral and neurogenomic responses to attractive songs. These data are consistent with the idea that the acoustic properties of song carry social information, and that the current social situation modulates the neural and behavioral responses to these signals.     

Information Filtering via Heterogeneous Diffusion in Online Bipartite Networks

The rapid expansion of Internet brings us overwhelming online information, which is impossible for an individual to go through all of it. Therefore, recommender systems were created to help people dig through this abundance of information. In networks composed by users and objects, recommender algorithms based on diffusion have been proven to be one of the best performing methods. Previous works considered the diffusion process from user to object, and from object to user to be equivalent. We show in this work that it is not the case and we improve the quality of the recommendation by taking into account the asymmetrical nature of this process. We apply this idea to modify the state-of-the-art recommendation methods. The simulation results show that the new methods can outperform these existing methods in both recommendation accuracy and diversity. Finally, this modification is checked to be able to improve the recommendation in a realistic case.     

Optimizing Online Social Networks for Information Propagation

Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users'' activity frequency. In this paper, our empirical analysis shows that the distribution of online users'' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users'' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users'' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.     

Consistent Strategy Updating in Spatial and Non-Spatial Behavioral Experiments Does Not Promote Cooperation in Social Networks

The presence of costly cooperation between otherwise selfish actors is not trivial. A prominent mechanism that promotes cooperation is spatial population structure. However, recent experiments with human subjects report substantially lower level of cooperation then predicted by theoretical models. We analyze the data of such an experiment in which a total of 400 players play a Prisoner''s Dilemma on a square lattice in two treatments, either interacting via a fixed square lattice (15 independent groups) or with a population structure changing after each interaction (10 independent groups). We analyze the statistics of individual decisions and infer in which way they can be matched with the typical models of evolutionary game theorists. We find no difference in the strategy updating between the two treatments. However, the strategy updates are distinct from the most popular models which lead to the promotion of cooperation as shown by computer simulations of the strategy updating. This suggests that the promotion of cooperation by population structure is not as straightforward in humans as often envisioned in theoretical models.     

Impact of Repeated Exposures on Information Spreading in Social Networks

Clustered structure of social networks provides the chances of repeated exposures to carriers with similar information. It is commonly believed that the impact of repeated exposures on the spreading of information is nontrivial. Does this effect increase the probability that an individual forwards a message in social networks? If so, to what extent does this effect influence people’s decisions on whether or not to spread information? Based on a large-scale microblogging data set, which logs the message spreading processes and users’ forwarding activities, we conduct a data-driven analysis to explore the answer to the above questions. The results show that an overwhelming majority of message samples are more probable to be forwarded under repeated exposures, compared to those under only a single exposure. For those message samples that cover various topics, we observe a relatively fixed, topic-independent multiplier of the willingness of spreading when repeated exposures occur, regardless of the differences in network structure. We believe that this finding reflects average people’s intrinsic psychological gain under repeated stimuli. Hence, it makes sense that the gain is associated with personal response behavior, rather than network structure. Moreover, we find that the gain is robust against the change of message popularity. This finding supports that there exists a relatively fixed gain brought by repeated exposures. Based on the above findings, we propose a parsimonious model to predict the saturated numbers of forwarding activities of messages. Our work could contribute to better understandings of behavioral psychology and social media analytics.     

Competition between Homophily and Information Entropy Maximization in Social Networks

In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective.     

Chloride Co-transporter NKCC1 Inhibitor Bumetanide Enhances Neurogenesis and Behavioral Recovery in Rats After Experimental Stroke

Bumetanide, a selective Na⁺-K⁺-Cl^?-co-transporter inhibitor, is widely used in clinical practice as a loop diuretic. In addition, bumetanide has been reported to attenuate ischemia-induced cerebral edema and reduce neuronal injury. This study examined whether bumetanide could influence neurogenesis and behavioral recovery in rats after experimentally induced stroke. Adult male Wistar rats were randomly assigned to four groups: sham, sham treated with bumetanide, ischemia, and ischemia treated with bumetanide. Focal cerebral ischemia was induced by injection of endothelin-1. Bumetanide (0.2 mg/kg/day) was infused into the lateral ventricle with drug administration being initiated 1 week after ischemia and continued for 3 weeks. Behavioral impairment and recovery were evaluated by tapered/ledged beam-walking test on post-stroke days 28. Then, the rats were perfused for BrdU/DCX (neuroblast marker), BrdU/NeuN (neuronal marker), BrdU/GFAP (astrocyte marker), and BrdU/Iba-1 (microglia marker) immunohistochemistry. The numbers of neuroblasts in the subventricular zone (SVZ) were significantly increased after the experimentally induced stroke. Bumetanide treatment increased migration of neuroblasts in the SVZ towards the infarct area, enhanced long-term survival of newborn neurons, and improved sensorimotor recovery, but it did not exert any effects on inflammation. In conclusion, our results demonstrated that chronic bumetanide treatment enhances neurogenesis and behavioral recovery after experimentally induced stroke in rats.     

Link Prediction in Complex Networks: A Mutual Information Perspective

Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further boost the discriminative resolution of candidate links. In this paper, we reexamine the role of network topology in predicting missing links from the perspective of information theory, and present a practical approach based on the mutual information of network structures. It not only can improve the prediction accuracy substantially, but also experiences reasonable computing complexity.     

Environmental Enrichment Induces Behavioral Recovery and Enhanced Hippocampal Cell Proliferation in an Antidepressant-Resistant Animal Model for PTSD

Background

Post traumatic stress disorder (PTSD) can be considered the result of a failure to recover after a traumatic experience. Here we studied possible protective and therapeutic aspects of environmental enrichment (with and without a running wheel) in Sprague Dawley rats exposed to an inescapable foot shock procedure (IFS).

Methodology/Principal Findings

IFS induced long-lasting contextual and non-contextual anxiety, modeling some aspects of PTSD. Even 10 weeks after IFS the rats showed reduced locomotion in an open field. The antidepressants imipramine and escitalopram did not improve anxiogenic behavior following IFS. Also the histone deacetylase (HDAC) inhibitor sodium butyrate did not alleviate the IFS induced immobility. While environmental enrichment (EE) starting two weeks before IFS did not protect the animals from the behavioral effects of the shocks, exposure to EE either immediately after the shock or one week later induced complete recovery three weeks after IFS. In the next set of experiments a running wheel was added to the EE to enable voluntary exercise (EE/VE). This also led to reduced anxiety. Importantly, this behavioral recovery was not due to a loss of memory for the traumatic experience. The behavioral recovery correlated with an increase in cell proliferation in hippocampus, a decrease in the tissue levels of noradrenalin and increased turnover of 5-HT in prefrontal cortex and hippocampus.

Conclusions/Significance

This animal study shows the importance of (physical) exercise in the treatment of psychiatric diseases, including post-traumatic stress disorder and points out the possible role of EE in studying the mechanism of recovery from anxiety disorders.     

Link Prediction in Weighted Networks: A Weighted Mutual Information Model

The link-prediction problem is an open issue in data mining and knowledge discovery, which attracts researchers from disparate scientific communities. A wealth of methods have been proposed to deal with this problem. Among these approaches, most are applied in unweighted networks, with only a few taking the weights of links into consideration. In this paper, we present a weighted model for undirected and weighted networks based on the mutual information of local network structures, where link weights are applied to further enhance the distinguishable extent of candidate links. Empirical experiments are conducted on four weighted networks, and results show that the proposed method can provide more accurate predictions than not only traditional unweighted indices but also typical weighted indices. Furthermore, some in-depth discussions on the effects of weak ties in link prediction as well as the potential to predict link weights are also given. This work may shed light on the design of algorithms for link prediction in weighted networks.     

Information Networks in Amenity Transition Communities: A Comparative Case Study

Amenity transition, a major socio demographic trend in areas rich in natural resources, is characterized by economic and population growth as a result of retirement in-migration, increased rates of second home ownership, and increases in the number of industries that do not need to be proximate to a specific geographic location. Amenity transition is also characterized by increased intra-community conflict between long-term residents and in-migrants. This research analyzes whether the population growth accompanying amenity transition is associated with variations in the structure and characteristics of intra-community informational networks, as sociological theory would suggest. Methodologically, this is accomplished through a comparative analysis of the structure and characteristics of informational networks in three communities undergoing amenity transition. The analyses suggest population density is not related to either the structure of informational networks or the concentration of trust/distrust within them. When considered in conjunction with previous empirical work, these findings suggest the conflicts associated with amenity transition are more likely to arise because of conflicting value systems and ideologies as opposed to social structural changes in the communities themselves.     

Intrinsic Neuronal Properties Switch the Mode of Information Transmission in Networks

Diverse ion channels and their dynamics endow single neurons with complex biophysical properties. These properties determine the heterogeneity of cell types that make up the brain, as constituents of neural circuits tuned to perform highly specific computations. How do biophysical properties of single neurons impact network function? We study a set of biophysical properties that emerge in cortical neurons during the first week of development, eventually allowing these neurons to adaptively scale the gain of their response to the amplitude of the fluctuations they encounter. During the same time period, these same neurons participate in large-scale waves of spontaneously generated electrical activity. We investigate the potential role of experimentally observed changes in intrinsic neuronal properties in determining the ability of cortical networks to propagate waves of activity. We show that such changes can strongly affect the ability of multi-layered feedforward networks to represent and transmit information on multiple timescales. With properties modeled on those observed at early stages of development, neurons are relatively insensitive to rapid fluctuations and tend to fire synchronously in response to wave-like events of large amplitude. Following developmental changes in voltage-dependent conductances, these same neurons become efficient encoders of fast input fluctuations over few layers, but lose the ability to transmit slower, population-wide input variations across many layers. Depending on the neurons'' intrinsic properties, noise plays different roles in modulating neuronal input-output curves, which can dramatically impact network transmission. The developmental change in intrinsic properties supports a transformation of a networks function from the propagation of network-wide information to one in which computations are scaled to local activity. This work underscores the significance of simple changes in conductance parameters in governing how neurons represent and propagate information, and suggests a role for background synaptic noise in switching the mode of information transmission.     

Know Thy Neighbor: Costly Information Can Hurt Cooperation in Dynamic Networks

People need to rely on cooperation with other individuals in many aspects of everyday life, such as teamwork and economic exchange in anonymous markets. We study whether and how the ability to make or break links in social networks fosters cooperate, paying particular attention to whether information on an individual''s actions is freely available to potential partners. Studying the role of information is relevant as information on other people''s actions is often not available for free: a recruiting firm may need to call a job candidate''s references, a bank may need to find out about the credit history of a new client, etc. We find that people cooperate almost fully when information on their actions is freely available to their potential partners. Cooperation is less likely, however, if people have to pay about half of what they gain from cooperating with a cooperator. Cooperation declines even further if people have to pay a cost that is almost equivalent to the gain from cooperating with a cooperator. Thus, costly information on potential neighbors'' actions can undermine the incentive to cooperate in fluid networks.     

FctClus: A Fast Clustering Algorithm for Heterogeneous Information Networks

It is important to cluster heterogeneous information networks. A fast clustering algorithm based on an approximate commute time embedding for heterogeneous information networks with a star network schema is proposed in this paper by utilizing the sparsity of heterogeneous information networks. First, a heterogeneous information network is transformed into multiple compatible bipartite graphs from the compatible point of view. Second, the approximate commute time embedding of each bipartite graph is computed using random mapping and a linear time solver. All of the indicator subsets in each embedding simultaneously determine the target dataset. Finally, a general model is formulated by these indicator subsets, and a fast algorithm is derived by simultaneously clustering all of the indicator subsets using the sum of the weighted distances for all indicators for an identical target object. The proposed fast algorithm, FctClus, is shown to be efficient and generalizable and exhibits high clustering accuracy and fast computation speed based on a theoretic analysis and experimental verification.