Search

Social networks influence health-related behavior, such as obesity and smoking. While researchers have studied social networks as a driver for diffusion of influences and behavior, it is less understood how the structure or topology of the network, in itself, impacts an individual's health behavior and wellness state. In this paper, we investigate whether the structure or topology of a social network offers additional insight and predictability on an individual's health and wellness. We develop a method called the Network-Driven health predictor (NetCARE) that leverages features representative of social network structure. Using a large longitudinal data set of students enrolled in the NetHealth study at the University of Notre Dame, we show that the NetCARE method improves the overall prediction performance over the baseline models—that use demographics and physical attributes—by 38%, 65%, 55%, and 54% for the wellness states—stress, happiness, positive attitude, and self-assessed health—considered in this paper. [ABSTRACT FROM AUTHOR]

Micro-blogging systems have become one of the most important ways for information sharing. Network structure and users’ interactions such as forwarding behaviors have aroused considerable research attention, while mention, as a key feature in micro-blogging platforms which can improve the visibility of a message and direct it to a particular user beyond the underlying social structure, is seldom studied in previous works. In this paper, we empirically study the mention effect in information diffusion, using the dataset from a population-scale social media website. We find that users with high number of followers would receive much more mentions than others. We further investigate the effect of mention in information diffusion by examining the response probability with respect to the number of mentions in a message and observe a saturation at around 5 mentions. Furthermore, we find that the response probability is the highest when a reciprocal followship exists between users, and one is more likely to receive a target user’s response if they have similar social status. To illustrate these findings, we propose the response prediction task and formulate it as a binary classification problem. Extensive evaluation demonstrates the effectiveness of discovered factors. Our results have consequences for the understanding of human dynamics on the social network, and potential implications for viral marketing and public opinion monitoring. [ABSTRACT FROM AUTHOR]

This paper addresses the question of whether one can generate networks with a given global structure (defined by selected blockmodels, i.e., cohesive, core-periphery, hierarchical, and transitivity), considering only different types of triads. Two methods are used to generate networks: (i) the newly proposed method of relocating links; and (ii) the Monte Carlo Multi Chain algorithm implemented in the package in R. Most of the selected blockmodel types can be generated by considering all types of triads. The selection of only a subset of triads can improve the generated networks’ blockmodel structure. Yet, in the case of a hierarchical blockmodel without complete blocks on the diagonal, additional local structures are needed to achieve the desired global structure of generated networks. This shows that blockmodels can emerge based only on local processes that do not take attributes into account. [ABSTRACT FROM AUTHOR]

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]

We study a simple agent-based model of the recurring fashion cycles in the society that consists of two interacting communities: “snobs” and “followers” (or “opinion hunters”, hence the name of the model). Followers conform to all other individuals, whereas snobs conform only to their own group and anticonform to the other. The model allows to examine the role of the social structure, i.e. the influence of the number of inter-links between the two communities, as well as the role of the stability of links. The latter is accomplished by considering two versions of the same model—quenched (parameterized by fraction L of fixed inter-links) and annealed (parameterized by probability p that a given inter-link exists). Using Monte Carlo simulations and analytical treatment (the latter only for the annealed model), we show that there is a critical fraction of inter-links, above which recurring cycles occur. For p ≤ 0.5 we derive a relation between parameters L and p that allows to compare both models and show that the critical value of inter-connections, p*, is the same for both versions of the model (annealed and quenched) but the period of a fashion cycle is shorter for the quenched model. Near the critical point, the cycles are irregular and a change of fashion is difficult to predict. For the annealed model we also provide a deeper theoretical analysis. We conjecture on topological grounds that the so-called saddle node heteroclinic bifurcation appears at p*. For p ≥ 0.5 we show analytically the existence of the second critical value of p, for which the system undergoes Hopf’s bifurcation. [ABSTRACT FROM AUTHOR]

Extensive interdisciplinary literatures have built on the seminal spatial dilemmas model, which depicts the evolution of cooperation on regular lattices, with strategies propagating locally by relative fitness. In this model agents may cooperate with neighbors, paying an individual cost to enhance their collective welfare, or they may exploit cooperative neighbors and diminish collective welfare. Recent research has extended the model in numerous ways, incorporating behavioral noise, implementing other network topologies or adaptive networks, and employing alternative dynamics of replication. Although the underlying dilemma arises from two distinct dimensions—the gains for exploiting cooperative partners (Greed) and the cost of cooperating with exploitative partners (Fear)–most work following from the spatial dilemmas model has argued or assumed that the dilemma can be represented with a single parameter: This research has typically examined Greed or Fear in isolation, or a composite such as the K-index of Cooperation or the ratio of the benefit to cost of cooperation. We challenge this claim on theoretical grounds—showing that embedding interaction in networks generally leads Greed and Fear to have divergent, interactive, and highly nonlinear effects on cooperation at the macro level, even when individuals respond identically to Greed and Fear. Using computational experiments, we characterize both dynamic local behavior and long run outcomes across regions of this space. We also simulate interventions to investigate changes of Greed and Fear over time, showing how model behavior changes asymmetrically as boundaries in payoff space are crossed, leading some interventions to have irreversible effects on cooperation. We then replicate our experiments on inter-organizational network data derived from links through shared directors among 2,400 large US corporations, thus demonstrating our findings for Greed and Fear on a naturally-occurring network. In closing, we discuss implications of our main findings regarding Greed and Fear for the problem of cooperation on inter-organizational networks. [ABSTRACT FROM AUTHOR]

Teotihuacan was the first urban civilization of Mesoamerica and one of the largest of the ancient world. Following a tradition in archaeology to equate social complexity with centralized hierarchy, it is widely believed that the city’s origin and growth was controlled by a lineage of powerful individuals. However, much data is indicative of a government of co-rulers, and artistic traditions expressed an egalitarian ideology. Yet this alternative keeps being marginalized because the problems of collective action make it difficult to conceive how such a coalition could have functioned in principle. We therefore devised a mathematical model of the city’s hypothetical network of representatives as a formal proof of concept that widespread cooperation was realizable in a fully distributed manner. In the model, decisions become self-organized into globally optimal configurations even though local representatives behave and modify their relations in a rational and selfish manner. This self-optimization crucially depends on occasional communal interruptions of normal activity, and it is impeded when sections of the network are too independent. We relate these insights to theories about community-wide rituals at Teotihuacan and the city’s eventual disintegration. [ABSTRACT FROM AUTHOR]