Infected or informed? Social structure and the simultaneous transmission of information and infectious disease

This is the author accepted manuscript. The final version is available from Wiley via the DOI in this record Social interactions present opportunities for both information and infection to spread through populations. Social learning is often proposed as a key benefit of sociality, while infectious disease spread are proposed as a major cost. Multiple empirical and theoretical studies have demonstrated the importance of social structure for the transmission of either information or harmful pathogens and parasites, but rarely in combination. We provide an overview of relevant empirical studies, discuss differences in the transmission processes of infection and information, and review how these processes have been modelled. Finally, we highlight ways in which animal social network structure and dynamics might mediate the tradeoff between the sharing of information and infection. We reveal how modular social network structures can promote the spread of information and mitigate against the spread of infection relative to other network structures. We discuss how the maintenance of long-term social bonds, clustering of social contacts in time, and adaptive plasticity in behavioural interactions, all play important roles in influencing the transmission of information and infection. We provide novel hypotheses and suggest new directions for research that quantifies the transmission of information and infection simultaneously across different network structures to help tease apart their influence on the evolution of social behaviour.University of Exete

International Validation of a Nomogram to Predict Recurrence after Resection of Grade 1 and 2 Nonfunctioning Pancreatic Neuroendocrine Tumors

Background: Despite the low recurrence rate of resected nonfunctional pancreatic neuroendocrine tumors (NF-pNETs), nearly all patients undergo long-term surveillance. A prediction model for recurrence may help select patients for less intensive surveillance or identify patients for adjuvant therapy. The objective of this study was to assess the external validity of a recently published model predicting recurrence within 5 years after surgery for NF-pNET in an international cohort. This prediction model includes tumor grade, lymph node status and perineural invasion as predictors. Methods: Retrospectively, data were collected from 7 international referral centers on patients who underwent resection for a grade 1-2 NF-pNET between 1992 and 2018. Model performance was evaluated by calibration statistics, Harrel's C-statistic, and area under the curve (AUC) of the receiver operating characteristic curve for 5-year recurrence-free survival (RFS). A sub-analysis was performed in pNETs >2 cm. The model was improved to stratify patients into 3 risk groups (low, medium, high) for recurrence. Results: Overall, 342 patients were included in the validation cohort with a 5-year RFS of 83% (95% confidence interval [CI]: 78-88%). Fifty-eight patients (17%) developed a recurrence. Calibration showed an intercept of 0 and a slope of 0.74. The C-statistic was 0.77 (95% CI: 0.70-0.83), and the AUC for the prediction of 5-year RFS was 0.74. The prediction model had a better performance in tumors >2 cm (C-statistic 0.80). Conclusions: External validity of this prediction model for recurrence after curative surgery for grade 1-2 NF-pNET showed accurate overall performance using 3 easily accessible parameters. This model is available via www.pancreascalculator.com

I-Louvain: An Attributed Graph Clustering Method

International audienceModularity allows to estimate the quality of a partition into communities of a graph composed of highly interconnected vertices. In this article, we introduce a complementary measure, based on inertia, and specially conceived to evaluate the quality of a partition based on real attributes describing the vertices. We propose also I-Louvain, a graph nodes clustering method which uses our criterion , combined with Newman's modularity, in order to detect communities in attributed graph where real attributes are associated with the vertices. Our experiments show that combining the relational information with the attributes allows to detect the communities more efficiently than using only one type of information. In addition, our method is more robust to data degradation