Search

Size estimation is particularly important for populations whose members experience disproportionate health issues or pose elevated health risks to the ambient social structures in which they are embedded. Efforts to derive size estimates are often frustrated when the population is hidden or hard-to-reach in ways that preclude conventional survey strategies, as is the case when social stigma is associated with group membership or when group members are involved in illegal activities. This paper extends prior research on the problem of network population size estimation, building on established survey/sampling methodologies commonly used with hard-to-reach groups. Three novel one-step, network-based population size estimators are presented, for use in the context of uniform random sampling, respondent-driven sampling, and when networks exhibit significant clustering effects. We give provably sufficient conditions for the consistency of these estimators in large configuration networks. Simulation experiments across a wide range of synthetic network topologies validate the performance of the estimators, which also perform well on a real-world location-based social networking data set with significant clustering. Finally, the proposed schemes are extended to allow them to be used in settings where participant anonymity is required. Systematic experiments show favorable tradeoffs between anonymity guarantees and estimator performance. Taken together, we demonstrate that reasonable population size estimates are derived from anonymous respondent driven samples of 250-750 individuals, within ambient populations of 5,000-40,000. The method thus represents a novel and cost-effective means for health planners and those agencies concerned with health and disease surveillance to estimate the size of hidden populations. We discuss limitations and future work in the concluding section. [ABSTRACT FROM AUTHOR]

This paper demonstrates a framework of processes for identifying potential witnesses of events from evidence they post to social media. The research defines original evidence models for micro-blog content sources, the relative uncertainty of different evidence types, and models for testing evidence by combination. Methods to filter and extract evidence using automated and semi-automated means are demonstrated using a Twitter case study event. Further, an implementation to test extracted evidence using Dempster Shafer Theory of Evidence are presented. The results indicate that the inclusion of evidence from micro-blog text and linked image content can increase the number of micro-bloggers identified at events, in comparison to the number of micro-bloggers identified from geotags alone. Additionally, the number of micro-bloggers that can be tested for evidence corroboration or conflict, is increased by incorporating evidence identified in their posting history. [ABSTRACT FROM AUTHOR]

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. [ABSTRACT FROM AUTHOR]

This paper examines conflicts that occur between mining companies and civil society organizations (CSOs) around the world and offers an innovative analysis of mining conflicts from a social network perspective. The analysis showed that, as the number of CSOs involved in a conflict increased, its outcome was more likely to be perceived as a success in terms of environmental justice (EJ); if a CSO was connected to other central CSOs, the average perception of EJ success was likely to increase; and as network distance between two conflicts increased (or decreased), they were more likely to lead to different (or similar) EJ outcomes. Such network effects in mining conflicts have policy implications for EJ movements. It would be a strategic move on the part of successful CSOs to become involved in other major conflicts and disseminate information about how they achieved greater EJ success. [ABSTRACT FROM AUTHOR]

Due to the demand for performance improvement and the existence of prior information, semi-supervised community detection with pairwise constraints becomes a hot topic. Most existing methods have been successfully encoding the must-link constraints, but neglect the opposite ones, i.e., the cannot-link constraints, which can force the exclusion between nodes. In this paper, we are interested in understanding the role of cannot-link constraints and effectively encoding pairwise constraints. Towards these goals, we define an integral generative process jointly considering the network topology, must-link and cannot-link constraints. We propose to characterize this process as a Multi-variance Mixed Gaussian Generative (MMGG) Model to address diverse degrees of confidences that exist in network topology and pairwise constraints and formulate it as a weighted nonnegative matrix factorization problem. The experiments on artificial and real-world networks not only illustrate the superiority of our proposed MMGG, but also, most importantly, reveal the roles of pairwise constraints. That is, though the must-link is more important than cannot-link when either of them is available, both must-link and cannot-link are equally important when both of them are available. To the best of our knowledge, this is the first work on discovering and exploring the importance of cannot-link constraints in semi-supervised community detection. [ABSTRACT FROM AUTHOR]

Remote Internet voting places the control and secrecy of the immediate voting environment on the shoulder of the individual voter but it also turns voting into yet another on-line activity thus endangering the well-known social nature of voting and possibly reducing the crucial sense of civic duty that is important for a healthy democracy. There is however a complete lack of evidence to what degree this actually materializes once electronic voting is introduced. This paper uses individual level log data on Internet voting in Estonian elections between 2013–2015 to inspect if Internet voting retains the social nature of the voting act. We do so by examining if Internet voting in groups takes place and what implications it has for voting speed. We find strong evidence of e-voting in pairs. Same aged male-female pairs seem to be voting in close proximity to each other, consistent with spouses or partners voting together. Also, female-female and female-male pairs with large age differences seem to be voting together, consistent with a parent voting with an adult aged offspring. With regards to voting speed we see the second vote in a vote pair being considerably faster than the first vote, again indicating a shared voting act. We end with a discussion of how the onset of electronic voting does not make elections less social, but does make vote secrecy more a choice rather than a requirement. [ABSTRACT FROM AUTHOR]

Network address shuffling is a novel moving target defense (MTD) that invalidates the address information collected by the attacker by dynamically changing or remapping the host’s network addresses. However, most network address shuffling methods are limited by the limited address space and rely on the host’s static domain name to map to its dynamic address; therefore these methods cannot effectively defend against random scanning attacks, and cannot defend against an attacker who knows the target’s domain name. In this paper, we propose a network defense method based on random domain name and address mutation (RDAM), which increases the scanning space of the attacker through a dynamic domain name method and reduces the probability that a host will be hit by an attacker scanning IP addresses using the domain name system (DNS) query list and the time window methods. Theoretical analysis and experimental results show that RDAM can defend against scanning attacks and worm propagation more effectively than general network address shuffling methods, while introducing an acceptable operational overhead. [ABSTRACT FROM AUTHOR]

A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuristic procedures such as relocation algorithms, genetic algorithms, and simulated annealing. In this paper, we present a computationally efficient simulated annealing algorithm for maximum correlation core/periphery partitioning of binary networks. The algorithm is evaluated using simulated networks consisting of up to 2000 actors and spanning a variety of densities for the intra-core, intra-periphery, and inter-core-periphery components of the network. Core/periphery analyses of problem solving, trust, and information sharing networks for the frontline employees and managers of a consumer packaged goods manufacturer are provided to illustrate the use of the model. [ABSTRACT FROM AUTHOR]

Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly faster than the existing approaches based on direct enumeration of graphlets. The approach presented in this paper presents a generalization of the currently fastest method for counting 5-node graphlets in bioinformatics. The algorithm requires existence of a vertex with certain properties; we show that such vertex exists for graphlets of arbitrary size, except for complete graphs and a cycle with four nodes, which are treated separately. Empirical analysis of running time agrees with the theoretical results. [ABSTRACT FROM AUTHOR]

The extraction of information from social media is an essential yet complicated step for data analysis in multiple domains. In this paper, we present Vigi4Med Scraper, a generic open source framework for extracting structured data from web forums. Our framework is highly configurable; using a configuration file, the user can freely choose the data to extract from any web forum. The extracted data are anonymized and represented in a semantic structure using Resource Description Framework (RDF) graphs. This representation enables efficient manipulation by data analysis algorithms and allows the collected data to be directly linked to any existing semantic resource. To avoid server overload, an integrated proxy with caching functionality imposes a minimal delay between sequential requests. Vigi4Med Scraper represents the first step of Vigi4Med, a project to detect adverse drug reactions (ADRs) from social networks founded by the French drug safety agency Agence Nationale de Sécurité du Médicament (ANSM). Vigi4Med Scraper has successfully extracted greater than 200 gigabytes of data from the web forums of over 20 different websites. [ABSTRACT FROM AUTHOR]

Uncovering underlying community structures in complex networks has received considerable attention because of its importance in understanding structural attributes and group characteristics of networks. The algorithmic identification of such structures is a significant challenge. Local expanding methods have proven to be efficient and effective in community detection, but most methods are sensitive to initial seeds and built-in parameters. In this paper, we present a local expansion method by density-based clustering, which aims to uncover the intrinsic network communities by locating the structural centers of communities based on a proposed structural centrality. The structural centrality takes into account local density of nodes and relative distance between nodes. The proposed algorithm expands a community from the structural center to the border with a single local search procedure. The local expanding procedure follows a heuristic strategy as allowing it to find complete community structures. Moreover, it can identify different node roles (cores and outliers) in communities by defining a border region. The experiments involve both on real-world and artificial networks, and give a comparison view to evaluate the proposed method. The result of these experiments shows that the proposed method performs more efficiently with a comparative clustering performance than current state of the art methods. [ABSTRACT FROM AUTHOR]

Maximisation of influence propagation is a key ingredient to any viral marketing or socio-political campaigns. However, it is an NP-hard problem, and various approximate algorithms have been suggested to address the issue, though not largely successful. In this paper, we propose a bio-inspired approach to select the initial set of nodes which is significant in rapid convergence towards a sub-optimal solution in minimal runtime. The performance of the algorithm is evaluated using the re-tweet network of the hashtag #KissofLove on Twitter associated with the non-violent protest against the moral policing spread to many parts of India. Comparison with existing centrality based node ranking process the proposed method significant improvement on influence propagation. The proposed algorithm is one of the hardly few bio-inspired algorithms in network theory. We also report the results of the exploratory analysis of the network kiss of love campaign. [ABSTRACT FROM AUTHOR]

This paper proposes a system for predicting increases in virtual world user actions. The virtual world user population is a very important aspect of these worlds; however, methods for predicting fluctuations in these populations have not been well documented. Therefore, we attempt to predict changes in virtual world user populations with deep learning, using easily accessible online data, including formal datasets from Google Trends, Wikipedia, and online communities, as well as informal datasets collected from online forums. We use the proposed system to analyze the user population of EVE Online, one of the largest virtual worlds. [ABSTRACT FROM AUTHOR]

The use of Internet-based sources of information for health surveillance applications has increased in recent years, as a greater share of social and media activity happens through online channels. The potential surveillance value in online sources of information about emergent health events include early warning, situational awareness, risk perception and evaluation of health messaging among others. The challenge in harnessing these sources of data is the vast number of potential sources to monitor and developing the tools to translate dynamic unstructured content into actionable information. In this paper we investigated the use of one social media outlet, Twitter, for surveillance of avian influenza risk in North America. We collected AI-related messages over a five-month period and compared these to official surveillance records of AI outbreaks. A fully automated data extraction and analysis pipeline was developed to acquire, structure, and analyze social media messages in an online context. Two methods of outbreak detection; a static threshold and a cumulative-sum dynamic threshold; based on a time series model of normal activity were evaluated for their ability to discern important time periods of AI-related messaging and media activity. Our findings show that peaks in activity were related to real-world events, with outbreaks in Nigeria, France and the USA receiving the most attention while those in China were less evident in the social media data. Topic models found themes related to specific AI events for the dynamic threshold method, while many for the static method were ambiguous. Further analyses of these data might focus on quantifying the bias in coverage and relation between outbreak characteristics and detectability in social media data. Finally, while the analyses here focused on broad themes and trends, there is likely additional value in developing methods for identifying low-frequency messages, operationalizing this methodology into a comprehensive system for visualizing patterns extracted from the Internet, and integrating these data with other sources of information such as wildlife, environment, and agricultural data. [ABSTRACT FROM AUTHOR]

This paper advances theories of social learning through an empirical examination of how social networks change over time. Social networks are important for learning because they constrain individuals’ access to information about the behaviors and cognitions of other people. Using data on a large social network of mobile device users over a one-month time period, we test three hypotheses: 1) attraction homophily causes individuals to form ties on the basis of attribute similarity, 2) aversion homophily causes individuals to delete existing ties on the basis of attribute dissimilarity, and 3) social influence causes individuals to adopt the attributes of others they share direct ties with. Statistical models offer varied degrees of support for all three hypotheses and show that these mechanisms are more complex than assumed in prior work. Although homophily is normally thought of as a process of attraction, people also avoid relationships with others who are different. These mechanisms have distinct effects on network structure. While social influence does help explain behavior, people tend to follow global trends more than they follow their friends. [ABSTRACT FROM AUTHOR]

Background: Online broadcasting substantially affects the production, distribution, and profit of TV series. In addition, online word-of-mouth significantly affects the diffusion of TV series. Because on-demand streaming rates are the most important factor that influences the earnings of online video suppliers, streaming statistics and forecasting trends are valuable. In this paper, we investigate the effects of periodic impulsive stimulation and pre-launch promotion on on-demand streaming dynamics. We consider imbalanced audience feverish distribution using an impulsive susceptible-infected-removed(SIR)-like model. In addition, we perform a correlation analysis of online buzz volume based on Baidu Index data. Methods: We propose a PI-SIR model to evolve audience dynamics and translate them into on-demand streaming fluctuations, which can be observed and comprehended by online video suppliers. Six South Korean TV series datasets are used to test the model. We develop a coarse-to-fine two-step fitting scheme to estimate the model parameters, first by fitting inter-period accumulation and then by fitting inner-period feverish distribution. Results: We find that audience members display similar viewing habits. That is, they seek new episodes every update day but fade away. This outcome means that impulsive intensity plays a crucial role in on-demand streaming diffusion. In addition, the initial audience size and online buzz are significant factors. On-demand streaming fluctuation is highly correlated with online buzz fluctuation. Conclusion: To stimulate audience attention and interpersonal diffusion, it is worthwhile to invest in promotion near update days. Strong pre-launch promotion is also a good marketing tool to improve overall performance. It is not advisable for online video providers to promote several popular TV series on the same update day. Inter-period accumulation is a feasible forecasting tool to predict the future trend of the on-demand streaming amount. The buzz in public social communities also represents a highly correlated analysis tool to evaluate the advertising value of TV series. [ABSTRACT FROM AUTHOR]

Exploring the interplay between information spreading and epidemic spreading is a topic that has been receiving increasing attention. As an efficient means of depicting the spreading of information, which manifests as a cascade phenomenon, awareness cascading is utilized to investigate this coupled transmission. Because in reality, different individuals facing the same epidemic will exhibit distinct behaviors according to their own experiences and attributes, it is important for us to consider the heterogeneity of individuals. Consequently, we propose a heterogeneous spreading model. To describe the heterogeneity, two of the most important but radically different methods for this purpose, the degree and k-core measures, are studied in this paper through three models based on different assumptions. Adopting a Markov chain approach, we succeed in predicting the epidemic threshold trend. Furthermore, we find that when the k-core measure is used to classify individuals, the spreading process is robust to these models, meaning that regardless of the model used, the spreading process is nearly identical at the macroscopic level. In addition, the k-core measure leads to a much larger final epidemic size than the degree measure. These results are cross-checked through numerous simulations, not only of a synthetic network but also of a real multiplex network. The presented findings provide a better understanding of k-core individuals and reveal the importance of considering network structure when investigating various dynamic processes. [ABSTRACT FROM AUTHOR]

Social media analysis has shown tremendous potential to understand public's opinion on a wide variety of topics. In this paper, we have mined Twitter to understand the public's perception of the Internet of Things (IoT). We first generated the discussion trends of the IoT from multiple Twitter data sources and validated these trends with Google Trends. We then performed sentiment analysis to gain insights of the public’s attitude towards the IoT. As anticipated, our analysis indicates that the public's perception of the IoT is predominantly positive. Further, through topic modeling, we learned that public tweets discussing the IoT were often focused on business and technology. However, the public has great concerns about privacy and security issues toward the IoT based on the frequent appearance of related terms. Nevertheless, no unexpected perceptions were identified through our analysis. Our analysis was challenged by the limited fraction of tweets relevant to our study. Also, the user demographics of Twitter users may not be strongly representative of the population of the general public. [ABSTRACT FROM AUTHOR]

In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of “commonly accepted beliefs” seems rarely studied. In this paper, we examine how the growth process of a (social) network is influenced by past circumstances. In order to tackle this cause, we simply modify the well known preferential attachment mechanism by imposing a time dependent kernel function in the network evolution equation. This approach leads to a fractional order Barabási-Albert (BA) differential equation, generalizing the BA model. Our results show that, with passing time, an aging process is observed for the network dynamics. The aging process leads to a decay for the node degree values, thereby creating an opposing process to the preferential attachment mechanism. On one hand, based on the preferential attachment mechanism, nodes with a high degree are more likely to absorb links; but, on the other hand, a node’s age has a reduced chance for new connections. This competitive scenario allows an increased chance for younger members to become a hub. Simulations of such a network growth with aging constraint confirm the results found from solving the fractional BA equation. We also report, as an exemplary application, an investigation of the collaboration network between Hollywood movie actors. It is undubiously shown that a decay in the dynamics of their collaboration rate is found, even including a sex difference. Such findings suggest a widely universal application of the so generalized BA model. [ABSTRACT FROM AUTHOR]

Human social interaction is often intermittent. Two acquainted persons can have extended periods without social interaction punctuated by periods of repeated interaction. In this case, the repeated interaction can be characterized by a seed initiative by either of the persons and a number of follow-up interactions. The tendency to initiate social interaction plays an important role in the formation of social networks and is in general not symmetric between persons. In this paper, we study the dynamics of initiative by analysing and modeling a detailed call and text message network sampled from a group of 700 individuals. We show that in an average relationship between two individuals, one part is almost twice as likely to initiate communication compared to the other part. The asymmetry has social consequences and ultimately might lead to the discontinuation of a relationship. We explain the observed asymmetry by a positive feedback mechanism where individuals already taking initiative are more likely to take initiative in the future. In general, people with many initiatives receive attention from a broader spectrum of friends than people with few initiatives. Lastly, we compare the likelihood of taking initiative with the basic personality traits of the five factor model. [ABSTRACT FROM AUTHOR]

Classification based on social dimensions is commonly used to handle the multi-label classification task in heterogeneous networks. However, traditional methods, which mostly rely on the community detection algorithms to extract the latent social dimensions, produce unsatisfactory performance when community detection algorithms fail. In this paper, we propose a novel behavior based social dimensions extraction method to improve the classification performance in multi-label heterogeneous networks. In our method, nodes’ behavior features, instead of community memberships, are used to extract social dimensions. By introducing Latent Dirichlet Allocation (LDA) to model the network generation process, nodes’ connection behaviors with different communities can be extracted accurately, which are applied as latent social dimensions for classification. Experiments on various public datasets reveal that the proposed method can obtain satisfactory classification results in comparison to other state-of-the-art methods on smaller social dimensions. [ABSTRACT FROM AUTHOR]

Twitter is an extremely high volume platform for user generated contributions regarding any topic. The wealth of content created at real-time in massive quantities calls for automated approaches to identify the topics of the contributions. Such topics can be utilized in numerous ways, such as public opinion mining, marketing, entertainment, and disaster management. Towards this end, approaches to relate single or partial posts to knowledge base items have been proposed. However, in microblogging systems like Twitter, topics emerge from the culmination of a large number of contributions. Therefore, identifying topics based on collections of posts, where individual posts contribute to some aspect of the greater topic is necessary. Models, such as Latent Dirichlet Allocation (LDA), propose algorithms for relating collections of posts to sets of keywords that represent underlying topics. In these approaches, figuring out what the specific topic(s) the keyword sets represent remains as a separate task. Another issue in topic detection is the scope, which is often limited to specific domain, such as health. This work proposes an approach for identifying domain-independent specific topics related to sets of posts. In this approach, individual posts are processed and then aggregated to identify key tokens, which are then mapped to specific topics. Wikipedia article titles are selected to represent topics, since they are up to date, user-generated, sophisticated articles that span topics of human interest. This paper describes the proposed approach, a prototype implementation, and a case study based on data gathered during the heavily contributed periods corresponding to the four US election debates in 2012. The manually evaluated results (0.96 precision) and other observations from the study are discussed in detail. [ABSTRACT FROM AUTHOR]

Instant messaging (IM) has changed the way people communicate with each other. However, the interactive and instant nature of these applications (apps) made them an attractive choice for malicious cyber activities such as phishing. The forensic examination of IM apps for modern Windows 8.1 (or later) has been largely unexplored, as the platform is relatively new. In this paper, we seek to determine the data remnants from the use of two popular Windows Store application software for instant messaging, namely Facebook and Skype on a Windows 8.1 client machine. This research contributes to an in-depth understanding of the types of terrestrial artefacts that are likely to remain after the use of instant messaging services and application software on a contemporary Windows operating system. Potential artefacts detected during the research include data relating to the installation or uninstallation of the instant messaging application software, log-in and log-off information, contact lists, conversations, and transferred files. [ABSTRACT FROM AUTHOR]

The friendship paradox is the phenomenon that in social networks, people on average have fewer friends than their friends do. The generalized friendship paradox is an extension to attributes other than the number of friends. The friendship paradox and its generalized version have gathered recent attention due to the information they provide about network structure and local inequalities. In this paper, we propose several measures of nodal qualities which capture different aspects of their activities and influence in online social networks. Using these measures we analyse the prevalence of the generalized friendship paradox over Twitter and we report high levels of prevalence (up to over 90% of nodes). We contend that this prevalence of the friendship paradox and its generalized version arise because of the hierarchical nature of the connections in the network. This hierarchy is nested as opposed to being star-like. We conclude that these paradoxes are collective phenomena not created merely by a minority of well-connected or high-attribute nodes. Moreover, our results show that a large fraction of individuals can experience the generalized friendship paradox even in the absence of a significant correlation between degrees and attributes. [ABSTRACT FROM AUTHOR]

Sports fans are able to watch games from many locations using TV services while interacting with other fans online. In this paper, we identify the factors that affect sports viewers’ online interactions. Using a large-scale dataset of more than 25 million chat messages from a popular social TV site for baseball, we extract various game-related factors, and investigate the relationships between these factors and fans’ interactions using a series of multiple regression analyses. As a result, we identify several factors that are significantly related to viewer interactions. In addition, we determine that the influence of these factors varies according to the user group; i.e., active vs. less active users, and loyal vs. non-loyal users. [ABSTRACT FROM AUTHOR]

The user-based collaborative filtering (CF) algorithm is one of the most popular approaches for making recommendation. Despite its success, the traditional user-based CF algorithm suffers one serious problem that it only measures the influence between two users based on their symmetric similarities calculated by their consumption histories. It means that, for a pair of users, the influences on each other are the same, which however may not be true. Intuitively, an expert may have an impact on a novice user but a novice user may not affect an expert at all. Besides, each user may possess a global importance factor that affects his/her influence to the remaining users. To this end, in this paper, we propose an asymmetric user influence model to measure the directed influence between two users and adopt the PageRank algorithm to calculate the global importance value of each user. And then the directed influence values and the global importance values are integrated to deduce the final influence values between two users. Finally, we use the final influence values to improve the performance of the traditional user-based CF algorithm. Extensive experiments have been conducted, the results of which have confirmed that both the asymmetric user influence model and global importance value play key roles in improving recommendation accuracy, and hence the proposed method significantly outperforms the existing recommendation algorithms, in particular the user-based CF algorithm on the datasets of high rating density. [ABSTRACT FROM AUTHOR]

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at and . [ABSTRACT FROM AUTHOR]

Background: Improved understanding and quantification of social contact patterns that govern the transmission dynamics of respiratory viral infections has utility in the design of preventative and control measures such as vaccination and social distancing. The objective of this study was to quantify an age-specific matrix of contact rates for a predominantly rural low-income population that would support transmission dynamic modeling of respiratory viruses. Methods and Findings: From the population register of the Kilifi Health and Demographic Surveillance System, coastal Kenya, 150 individuals per age group (<1, 1–5, 6–15, 16–19, 20–49, 50 and above, in years) were selected by stratified random sampling and requested to complete a day long paper diary of physical contacts (e.g. touch or embrace). The sample was stratified by residence (rural-to-semiurban), month (August 2011 to January 2012, spanning seasonal changes in socio-cultural activities), and day of week. Usable diary responses were obtained from 568 individuals (∼50% of expected). The mean number of contacts per person per day was 17.7 (95% CI 16.7–18.7). Infants reported the lowest contact rates (mean 13.9, 95% CI 12.1–15.7), while primary school students (6–15 years) reported the highest (mean 20.1, 95% CI 18.0–22.2). Rates of contact were higher within groups of similar age (assortative), particularly within the primary school students and adults (20–49 years). Adults and older participants (>50 years) exhibited the highest inter-generational contacts. Rural contact rates were higher than semiurban (18.8 vs 15.6, p = 0.002), with rural primary school students having twice as many assortative contacts as their semiurban peers. Conclusions and Significance: This is the first age-specific contact matrix to be defined for tropical Sub-Saharan Africa and has utility in age-structured models to assess the potential impact of interventions for directly transmitted respiratory infections. [ABSTRACT FROM AUTHOR]

We propose a novel laboratory experiment to document the pressure to share income within social networks in Africa. We find that the redistributive pressure exerted via the possibility of receiving a claim increases altruism, while the possibility of hiding from such claim reduces it. Our results indicate that sharing norms are crucial drivers of giving to other members of the network. We also find that pressure to share has a detrimental effect on the undertaking of profitable but risky investments. [ABSTRACT FROM AUTHOR]

The advent of social networks revolutionized the way people access to information sources. Understanding the complex relationship between these sources and users is crucial. We introduce an algorithm, that we call PopRank, to assess both the Impact of Facebook pages as well as users’ Engagement on the basis of their mutual interactions. The ideas behind the PopRank are that i) high impact pages attract many users with a low engagement, which means that they receive comments from users that rarely comment, and ii) high engagement users interact with high impact pages, that is they mostly comment pages with a high popularity. The resulting ranking of pages can predict the number of comments a page will receive and the number of its future posts. Pages’ impact turns out to be slightly dependent on the quality of pages’ informative content (e.g., science vs conspiracy) but independent of users’ polarization. [ABSTRACT FROM AUTHOR]

In this work, we study the opinion limit states for a generalized bounded confidence agent-based opinion model. Agents can select multiple opinions in the network, and the confidence bound is considered on the distance between the average of the selected opinions and agent opinion itself. The number of selection agents for a certain agent, which is also called the selection number, means the agent opinion interaction degree. It is known that when the confidence bound is large sufficiently, opinions reach consensus almost surely. We mainly study the opinion consensus and the opinion polarization when the confidence bound is small sufficiently. Firstly, we provide and prove the upper and lower bounds for the opinion consensus probability of this bound confidence model. It shows that the opinion consensus probability almost always decreases as the confidence bound decreases. Secondly, the opinion consensus probability is larger than the one for the opinion evolution of the Deffuant-Weisbuch model. Finally, we demonstrate the ultimate probability distribution of one agent opinion and compare it with the gossip form and the general bounded confidence form, and demonstrate how the opinion polarization probabilities evolve as the selection number changes. Specially, different from other studies, we find that the opinion polarization would happen more easily if the opinion interaction degree is strengthened. In a sum, the multiple selection mechanism will increase the opinion consensus probability and the opinion polarization probability, respectively, comparing to the single selection mechanism. [ABSTRACT FROM AUTHOR]

The recommender system is widely used in the field of e-commerce and plays an important role in guiding customers to make smart decisions. Although many algorithms are available in the recommender system, collaborative filtering is still one of the most used and successful recommendation technologies. In collaborative filtering, similarity calculation is the main issue. In order to improve the accuracy and quality of recommendations, we proposed an improved similarity model, which takes three impact factors of similarity into account to minimize the deviation of similarity calculation. Compared with the traditional similarity measure, the advantages of our proposed model are that it makes full use of rating data and solves the problem of co-rated items. To validate the efficiency of the proposed algorithm, experiments were performed on four datasets. Results show that the proposed method can effectively improve the preferences of the recommender system and it is suitable for the sparsity data. [ABSTRACT FROM AUTHOR]

Laboratory experiments offer an opportunity to isolate human behaviors with a level of precision that is often difficult to obtain using other (survey-based) methods. Yet, experimental tasks are often stripped of any social context, implying that inferences may not directly map to real world contexts. We randomly allocate 632 individuals (grouped randomly into 316 dyads) from small villages in Sierra Leone to four versions of the ultimatum game. In addition to the classic ultimatum game, where both the sender and receiver are anonymous, we reveal the identity of the sender, the receiver or both. This design allows us to explore how fairness behavior is affected by social context in a natural setting where players are drawn from populations that are well-acquainted. We find that average offers increase when the receiver’s identity is revealed, suggesting that anonymous ultimatum games underestimate expected fair offers. This study suggest that researchers wishing to relate laboratory behavior to contexts in which the participants are well-acquainted should consider revealing the identities of the players during game play. [ABSTRACT FROM AUTHOR]

Professional association football is a game of talent. The success of a professional club hinges largely on its ability of assembling the best team. Building on a dataset of player transfer records among more than 400 clubs in 24 world-wide top class leagues from 2011 to 2015, this study aims to relate a club’s success to its activities in the player transfer market from a network perspective. We confirm that modern professional football is indeed a money game, in which larger investment spent on the acquisition of talented players generally yields better team performance. However, further investigation shows that professional football clubs can actually play different strategies in surviving or even excelling this game, and the success of strategies is strongly associated to their network properties in the football player transfer network. [ABSTRACT FROM AUTHOR]

Many real networks that are collected or inferred from data are incomplete due to missing edges. Missing edges can be inherent to the dataset (Facebook friend links will never be complete) or the result of sampling (one may only have access to a portion of the data). The consequence is that downstream analyses that “consume” the network will often yield less accurate results than if the edges were complete. Community detection algorithms, in particular, often suffer when critical intra-community edges are missing. We propose a novel consensus clustering algorithm to enhance community detection on incomplete networks. Our framework utilizes existing community detection algorithms that process networks imputed by our link prediction based sampling algorithm and merges their multiple partitions into a final consensus output. On average our method boosts performance of existing algorithms by 7% on artificial data and 17% on ego networks collected from Facebook. [ABSTRACT FROM AUTHOR]

The explosive growth of social networks in recent times has presented a powerful source of information to be utilized as an extra source for assisting in the social recommendation problems. The social recommendation methods that are based on probabilistic matrix factorization improved the recommendation accuracy and partly solved the cold-start and data sparsity problems. However, these methods only exploited the explicit social relations and almost completely ignored the implicit social relations. In this article, we firstly propose an algorithm to extract the implicit relation in the undirected graphs of social networks by exploiting the link prediction techniques. Furthermore, we propose a new probabilistic matrix factorization method to alleviate the data sparsity problem through incorporating explicit friendship and implicit friendship. We evaluate our proposed approach on two real datasets, Last.Fm and Douban. The experimental results show that our method performs much better than the state-of-the-art approaches, which indicates the importance of incorporating implicit social relations in the recommendation process to address the poor prediction accuracy. [ABSTRACT FROM AUTHOR]

Objective: The study investigates the effect on cooperation in multiplayer games, when the population from which all individuals are drawn is structured—i.e. when a given individual is only competing with a small subset of the entire population. Method: To optimize the focus on multiplayer effects, a class of games were chosen for which the payoff depends nonlinearly on the number of cooperators—this ensures that the game cannot be represented as a sum of pair-wise interactions, and increases the likelihood of observing behaviour different from that seen in two-player games. The chosen class of games are named “threshold games”, and are defined by a threshold, M > 0, which describes the minimal number of cooperators in a given match required for all the participants to receive a benefit. The model was studied primarily through numerical simulations of large populations of individuals, each with interaction neighbourhoods described by various classes of networks. Results: When comparing the level of cooperation in a structured population to the mean-field model, we find that most types of structure lead to a decrease in cooperation. This is both interesting and novel, simply due to the generality and breadth of relevance of the model—it is likely that any model with similar payoff structure exhibits related behaviour. More importantly, we find that the details of the behaviour depends to a large extent on the size of the immediate neighbourhoods of the individuals, as dictated by the network structure. In effect, the players behave as if they are part of a much smaller, fully mixed, population, which we suggest an expression for. [ABSTRACT FROM AUTHOR]

According to the Centers for Disease Control and Prevention (CDC), one in twenty five hospital patients are infected with at least one healthcare acquired infection (HAI) on any given day. Early detection of possible HAI outbreaks help practitioners implement countermeasures before the infection spreads extensively. Here, we develop an efficient data and model driven method to detect outbreaks with high accuracy. We leverage mechanistic modeling of C. difficile infection, a major HAI disease, to simulate its spread in a hospital wing and design efficient near-optimal algorithms to select people and locations to monitor using an optimization formulation. Results show that our strategy detects up to 95% of “future” C. difficile outbreaks. We design our method by incorporating specific hospital practices (like swabbing for infections) as well. As a result, our method outperforms state-of-the-art algorithms for outbreak detection. Finally, a qualitative study of our result shows that the people and locations we select to monitor as sensors are intuitive and meaningful. [ABSTRACT FROM AUTHOR]

Background: There has been a growing interest in understanding the effects of social networks on health-related behaviour, with a particular backdrop being the emerging prominence of complexity or systems science in public health. Social network interventions specifically use or alter the characteristics of social networks to generate, accelerate, or maintain health behaviours. We conducted a systematic review and meta-analysis to investigate health behaviour outcomes of social network interventions.Methods and Findings: We searched eight databases and two trial registries from 1990 to May 28, 2019, for English-language reports of randomised controlled trials (RCTs) and before-and-after studies investigating social network interventions for health behaviours and outcomes. Trials that did not specifically use social networks or that did not include a comparator group were excluded. We screened studies and extracted data from published reports independently. The primary outcome of health behaviours or outcomes at ≤6 months was assessed by random-effects meta-analysis. Secondary outcomes included those measures at >6-12 months and >12 months. This study is registered with the International Prospective Register of Systematic Reviews, PROSPERO: CRD42015023541. We identified 26,503 reports; after exclusion, 37 studies, conducted between 1996 and 2018 from 11 countries, were eligible for analysis, with a total of 53,891 participants (mean age 32.4 years [SD 12.7]; 45.5% females). A range of study designs were included: 27 used RCT/cluster RCT designs, and 10 used other study designs. Eligible studies addressed a variety of health outcomes, in particular sexual health and substance use. Social network interventions showed a significant intervention effect compared with comparator groups for sexual health outcomes. The pooled odds ratio (OR) was 1.46 (95% confidence interval [CI] 1.01-2.11; I2 = 76%) for sexual health outcomes at ≤6 months and OR 1.51 (95% CI 1.27-1.81; I2 = 40%) for sexual health outcomes at >6-12 months. Intervention effects for drug risk outcomes at each time point were not significant. There were also significant intervention effects for some other health outcomes including alcohol misuse, well-being, change in haemoglobin A1c (HbA1c), and smoking cessation. Because of clinical and measurement heterogeneity, it was not appropriate to pool data on these other behaviours in a meta-analysis. For sexual health outcomes, prespecified subgroup analyses were significant for intervention approach (p < 0.001), mean age of participants (p = 0.002), and intervention length (p = 0.05). Overall, 22 of the 37 studies demonstrated a high risk of bias, as measured by the Cochrane Risk of Bias tool. The main study limitations identified were the inclusion of studies of variable quality; difficulty in isolating the effects of specific social network intervention components on health outcomes, as interventions included other active components; and reliance on self-reported outcomes, which have inherent recall and desirability biases.Conclusions: Our findings suggest that social network interventions can be effective in the short term (<6 months) and longer term (>6 months) for sexual health outcomes. Intervention effects for drug risk outcomes at each time point were not significant. There were also significant intervention effects for some other health outcomes including alcohol misuse, well-being, change in HbA1c, and smoking cessation. [ABSTRACT FROM AUTHOR]

Trust is praised by many social scientists as the foundation of functioning social systems owing to its assumed connection to cooperative behavior. The existence of such a link is still subject to debate. In the present study, we first highlight important conceptual issues within this debate. Second, we examine previous evidence, highlighting several issues. Third, we present findings from an original experiment, in which we tried to identify a “real” situation that allowed us to measure both trust and cooperation. People’s expectations and behavior when they decide to share (or not) their data represents such a situation, and we make use of corresponding data. We found that there is no relationship between trust and cooperation. This non-relationship may be rationalized in different ways which, in turn, provides important lessons for the study of the trust—behavior nexus beyond the particular situation we study empirically. [ABSTRACT FROM AUTHOR]

Hierarchical organisation is a prevalent feature of many complex networks appearing in nature and society. A relating interesting, yet less studied question is how does a hierarchical network evolve over time? Here we take a data driven approach and examine the time evolution of the network between the Medical Subject Headings (MeSH) provided by the National Center for Biotechnology Information (NCBI, part of the U. S. National Library of Medicine). The network between the MeSH terms is organised into 16 different, yearly updated hierarchies such as “Anatomy”, “Diseases”, “Chemicals and Drugs”, etc. The natural representation of these hierarchies is given by directed acyclic graphs, composed of links pointing from nodes higher in the hierarchy towards nodes in lower levels. Due to the yearly updates, the structure of these networks is subject to constant evolution: new MeSH terms can appear, terms becoming obsolete can be deleted or be merged with other terms, and also already existing parts of the network may be rewired. We examine various statistical properties of the time evolution, with a special focus on the attachment and detachment mechanisms of the links, and find a few general features that are characteristic for all MeSH hierarchies. According to the results, the hierarchies investigated display an interesting interplay between non-uniform preference with respect to multiple different topological and hierarchical properties. [ABSTRACT FROM AUTHOR]