Publications
Results
- Showing results for:
- Reset all filters
Search results
-
Journal articleMyall AC, Peach RL, Weiße AY, et al., 2021,
Network memory in the movement of hospital patients carrying drug-resistant bacteria
, Applied Network Science, Vol: 6, ISSN: 2364-8228Hospitals constitute highly interconnected systems that bring into contact anabundance of infectious pathogens and susceptible individuals, thus makinginfection outbreaks both common and challenging. In recent years, there hasbeen a sharp incidence of antimicrobial-resistance amongsthealthcare-associated infections, a situation now considered endemic in manycountries. Here we present network-based analyses of a data set capturing themovement of patients harbouring drug-resistant bacteria across three largeLondon hospitals. We show that there are substantial memory effects in themovement of hospital patients colonised with drug-resistant bacteria. Suchmemory effects break first-order Markovian transitive assumptions andsubstantially alter the conclusions from the analysis, specifically on noderankings and the evolution of diffusive processes. We capture variable lengthmemory effects by constructing a lumped-state memory network, which we then useto identify overlapping communities of wards. We find that these communities ofwards display a quasi-hierarchical structure at different levels of granularitywhich is consistent with different aspects of patient flows related to hospitallocations and medical specialties.
-
Journal articleSaavedra-Garcia P, Roman-Trufero M, Al-Sadah HA, et al., 2021,
Systems level profiling of chemotherapy-induced stress resolution in cancer cells reveals druggable trade-offs
, Proceedings of the National Academy of Sciences of USA, Vol: 118, ISSN: 0027-8424Cancer cells can survive chemotherapy-induced stress, but how they recover from it is not known.Using a temporal multiomics approach, we delineate the global mechanisms of proteotoxic stressresolution in multiple myeloma cells recovering from proteasome inhibition. Our observations definelayered and protracted programmes for stress resolution that encompass extensive changes acrossthe transcriptome, proteome, and metabolome. Cellular recovery from proteasome inhibitioninvolved protracted and dynamic changes of glucose and lipid metabolism and suppression ofmitochondrial function. We demonstrate that recovering cells are more vulnerable to specific insultsthan acutely stressed cells and identify the general control nonderepressable 2 (GCN2)-driven cellularresponse to amino acid scarcity as a key recovery-associated vulnerability. Using a transcriptomeanalysis pipeline, we further show that GCN2 is also a stress-independent bona fide target intranscriptional signature-defined subsets of solid cancers that share molecular characteristics. Thus,identifying cellular trade-offs tied to the resolution of chemotherapy-induced stress in tumour cellsmay reveal new therapeutic targets and routes for cancer therapy optimisation.
-
Journal articleQian Y, Expert P, Panzarasa P, et al., 2021,
Geometric graphs from data to aid classification tasks with Graph Convolutional Networks
, Patterns, Vol: 2, Pages: 100237-100237, ISSN: 2666-3899 -
Journal articlePeach RL, Arnaudon A, Schmidt JA, et al., 2021,
HCGA: Highly comparative graph analysis for network phenotyping
, Patterns, Vol: 2, Pages: 100227-100227, ISSN: 2666-3899<jats:title>A<jats:sc>bstract</jats:sc></jats:title><jats:p>Networks are widely used as mathematical models of complex systems across many scientific disciplines, not only in biology and medicine but also in the social sciences, physics, computing and engineering. Decades of work have produced a vast corpus of research characterising the topological, combinatorial, statistical and spectral properties of graphs. Each graph property can be thought of as a feature that captures important (and some times overlapping) characteristics of a network. In the analysis of real-world graphs, it is crucial to integrate systematically a large number of diverse graph features in order to characterise and classify networks, as well as to aid network-based scientific discovery. In this paper, we introduce HCGA, a framework for highly comparative analysis of graph data sets that computes several thousands of graph features from any given network. HCGA also offers a suite of statistical learning and data analysis tools for automated identification and selection of important and interpretable features underpinning the characterisation of graph data sets. We show that HCGA outperforms other methodologies on supervised classification tasks on benchmark data sets whilst retaining the interpretability of network features. We also illustrate how HCGA can be used for network-based discovery through two examples where data is naturally represented as graphs: the clustering of a data set of images of neuronal morphologies, and a regression problem to predict charge transfer in organic semiconductors based on their structure. HCGA is an open platform that can be expanded to include further graph properties and statistical learning tools to allow researchers to leverage the wide breadth of graph-theoretical research to quantitatively analyse and draw insights from network data.</jats:p>
-
Journal articleMaes A, Barahona M, Clopath C, 2021,
Learning compositional sequences with multiple time scales through a hierarchical network of spiking neurons
, PLoS Computational Biology, Vol: 17, ISSN: 1553-734XSequential behaviour is often compositional and organised across multiple time scales: a set of individual elements developing on short time scales (motifs) are combined to form longer functional sequences (syntax). Such organisation leads to a natural hierarchy that can be used advantageously for learning, since the motifs and the syntax can be acquired independently. Despite mounting experimental evidence for hierarchical structures in neuroscience, models for temporal learning based on neuronal networks have mostly focused on serial methods. Here, we introduce a network model of spiking neurons with a hierarchical organisation aimed at sequence learning on multiple time scales. Using biophysically motivated neuron dynamics and local plasticity rules, the model can learn motifs and syntax independently. Furthermore, the model can relearn sequences efficiently and store multiple sequences. Compared to serial learning, the hierarchical model displays faster learning, more flexible relearning, increased capacity, and higher robustness to perturbations. The hierarchical model redistributes the variability: it achieves high motif fidelity at the cost of higher variability in the between-motif timings.
-
Journal articleKuntz Nussio J, Thomas P, Stan G, et al., 2021,
Approximations of countably-infinite linear programs over bounded measure spaces
, SIAM Journal on Optimization, Vol: 31, Pages: 604-625, ISSN: 1052-6234We study a class of countably-infinite-dimensional linear programs (CILPs)whose feasible sets are bounded subsets of appropriately defined spaces ofmeasures. The optimal value, optimal points, and minimal points of these CILPscan be approximated by solving finite-dimensional linear programs. We show howto construct finite-dimensional programs that lead to approximations witheasy-to-evaluate error bounds, and we prove that the errors converge to zero asthe size of the finite-dimensional programs approaches that of the originalproblem. We discuss the use of our methods in the computation of the stationarydistributions, occupation measures, and exit distributions of Markov~chains.
-
Journal articleKuntz J, Thomas P, Stan G-B, et al., 2021,
Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
, SIAM Review, ISSN: 0036-1445Computing the stationary distributions of a continuous-time Markov chaininvolves solving a set of linear equations. In most cases of interest, thenumber of equations is infinite or too large, and cannot be solved analyticallyor numerically. Several approximation schemes overcome this issue by truncatingthe state space to a manageable size. In this review, we first give acomprehensive theoretical account of the stationary distributions and theirrelation to the long-term behaviour of the Markov chain, which is readilyaccessible to non-experts and free of irreducibility assumptions made instandard texts. We then review truncation-based approximation schemes payingparticular attention to their convergence and to the errors they introduce, andwe illustrate their performance with an example of a stochastic reactionnetwork of relevance in biology and chemistry. We conclude by elaborating oncomputational trade-offs associated with error control and some open questions.
-
Journal articleClarke J, Murray A, Markar S, et al., 2020,
A new geographic model of care to manage the post-COVID-19 elective surgery aftershock in England: a retrospective observational study
, BMJ Open, Vol: 10, Pages: 1-9, ISSN: 2044-6055Objectives The suspension of elective surgery during the COVID pandemic is unprecedented and has resulted in record volumes of patients waiting for operations. Novel approaches that maximise capacity and efficiency of surgical care are urgently required. This study applies Markov Multiscale Community Detection (MMCD), an unsupervised graph-based clustering framework, to identify new surgical care models based on pooled waiting lists delivered across an expanded network of surgical providers. DesignRetrospective observational study using Hospital Episode Statistics.SettingPublic and private hospitals providing surgical care to National Health Service (NHS) patients in England. ParticipantsAll adult patients resident in England undergoing NHS-funded planned surgical procedures between 1st April 2017 and 31st March 2018. Main outcome measuresThe identification of the most common planned surgical procedures in England (High Volume Procedures – HVP) and proportion of low, medium and high-risk patients undergoing each HVP. The mapping of hospitals providing surgical care onto optimised groupings based on patient usage data.ResultsA total of 7,811,891 planned operations were identified in 4,284,925 adults during the one-year period of our study. The 28 most common surgical procedures accounted for a combined 3,907,474 operations (50.0% of the total). 2,412,613 (61.7%) of these most common procedures involved ‘low risk’ patients. Patients travelled an average of 11.3 km for these procedures. Based on the data, MMCD partitioned England into 45, 16 and 7 mutually exclusive and collectively exhaustive natural surgical communities of increasing coarseness. The coarser partitions into 16 and 7 surgical communities were shown to be associated with balanced supply and demand for surgical care within communities.ConclusionsPooled waiting lists for low risk elective procedures and patients across integrated, expanded natural surgical community networks have the pot
-
Journal articleHoffmann T, Jones NS, 2020,
Inference of a universal social scale and segregation measures using social connectivity kernels
, Journal of the Royal Society Interface, Vol: 17, ISSN: 1742-5662How people connect with one another is a fundamental question in the social sciences, and the resulting social networks can have a profound impact on our daily lives. Blau offered a powerful explanation: people connect with one another based on their positions in a social space. Yet a principled measure of social distance, allowing comparison within and between societies, remains elusive.We use the connectivity kernel of conditionally-independent edge models to develop a family of segregation statistics with desirable properties: they offer an intuitive and universal characteristic scale on social space (facilitating comparison across datasets and societies), are applicable to multivariate and mixed node attributes, and capture segregation at the level of individuals, pairs of individuals, and society as a whole. We show that the segregation statistics can induce a metric on Blau space (a space spanned by the attributes of the members of society) and provide maps of two societies.Under a Bayesian paradigm, we infer the parameters of the connectivity kernel from eleven ego-network datasets collected in four surveys in the United Kingdom and United States. The importance of different dimensions of Blau space is similar across time and location, suggesting a macroscopically stable social fabric. Physical separation and age differences have the most significant impact on segregation within friendship networks with implications for intergenerational mixing and isolation in later stages of life.
-
Journal articleSethi S, Ewers R, Jones N, et al., 2020,
SAFE Acoustics: an open-source, real-time eco-acoustic monitoring network in the tropical rainforests of Borneo
, Methods in Ecology and Evolution, Vol: 11, Pages: 1182-1185, ISSN: 2041-210X1. Automated monitoring approaches offer an avenue to unlocking large‐scale insight into how ecosystems respond to human pressures. However, since data collection and data analyses are often treated independently, there are currently no open‐source examples of end‐to‐end, real‐time ecological monitoring networks. 2. Here, we present the complete implementation of an autonomous acoustic monitoring network deployed in the tropical rainforests of Borneo. Real‐time audio is uploaded remotely from the field, indexed by a central database, and delivered via an API to a public‐facing website.3. We provide the open‐source code and design of our monitoring devices, the central web2py database, and the ReactJS website. Furthermore, we demonstrate an extension of this infrastructure to deliver real‐time analyses of the eco‐acoustic data. 4. By detailing a fully functional, open source, and extensively tested design, our work will accelerate the rate at which fully autonomous monitoring networks mature from technological curiosities, and towards genuinely impactful tools in ecology.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.