Christian Lyngby Vestergaard
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Christian Lyngby Vestergaard has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Jean-Baptiste Masson
Institut Pasteur, Université Paris Cité, CNRS UMR 3571, Decision and Bayesian Computation, Paris, France
11 shared publications - François Laurent
Decision and Bayesian Computation, Institut Pasteur, Université Paris Cité, CNRS UMR3751
7 shared publications - Henrik Flyvbjerg
Technical University of Denmark
6 shared publications - Mathieu Génois
CNRS, CPT, Aix Marseille Univ, Université de Toulon, Marseille, France
6 shared publications Mathieu Génois
Aix Marseille Univ Univ. Toulon CNRS CPT Marseille France
5 shared publications- Alain Barrat
Aix Marseille Univ, Université de Toulon, CNRS, CPT, Marseille, France
4 shared publications
Latest Publications
- Open Access
- 20 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Information maximization for generalized multiarmed bandit games
Information and free-energy maximization are physics principles that provide general rules for an agent to optimize actions in line with specific goals and policies. These principles can serve as building blocks for designing decision-making policies capable of efficient performance with only partial information. Notably, the information-maximization principle has shown remarkable success in the classical bandit problem and has recently been shown to yield optimal algorithms for Gaussian and sub-Gaussian reward distributions. This article explores a broad extension of physics-based approaches to more complex and structured bandit problems. To this end, we cover three distinct types of bandit problems, where information maximization is adapted and leads to strong performance for Gaussian and Bernoulli reward distributions. Since the main challenge of information maximization lies in avoiding overexploration, we highlight how information is tailored at various levels to mitigate this issue, paving the way for more efficient and robust decision-making strategies.
- 20 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessInformation maximization for generalized multiarmed bandit games
Information and free-energy maximization are physics principles that provide general rules for an agent to optimize actions in line with specific goals and policies. These principles can serve as building blocks for designing decision-making policies capable of efficient performance with only partial information. Notably, the information-maximization principle has shown remarkable success in the classical bandit problem and has recently been shown to yield optimal algorithms for Gaussian and sub-Gaussian reward distributions. This article explores a broad extension of physics-based approaches to more complex and structured bandit problems. To this end, we cover three distinct types of bandit problems, where information maximization is adapted and leads to strong performance for Gaussian and Bernoulli reward distributions. Since the main challenge of information maximization lies in avoiding overexploration, we highlight how information is tailored at various levels to mitigate this issue, paving the way for more efficient and robust decision-making strategies.
- Open Access
- 10 October 2024
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 20 (10) , e1012460
Compression-based inference of network motif sets
Physical and functional constraints on biological networks lead to complex topological patterns across multiple scales in their organization. A particular type of higher-order network feature that has received considerable interest is network motifs, defined as statistically regular subgraphs. These may implement fundamental logical and computational circuits and are referred to as “building blocks of complex networks”. Their well-defined structures and small sizes also enable the testing of their functions in synthetic and natural biological experiments. Here, we develop a framework for motif mining based on lossless network compression using subgraph contractions. This provides an alternative definition of motif significance which allows us to compare different motifs and select the collectively most significant set of motifs as well as other prominent network features in terms of their combined compression of the network. Our approach inherently accounts for multiple testing and correlations between subgraphs and does not rely on a priori specification of an appropriate null model. It thus overcomes common problems in hypothesis testing-based motif analysis and guarantees robust statistical inference. We validate our methodology on numerical data and then apply it on synaptic-resolution biological neural networks, as a medium for comparative connectomics, by evaluating their respective compressibility and characterize their inferred circuit motifs.
- 10 October 2024
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 20 (10) , e1012460
Open AccessCompression-based inference of network motif sets
Physical and functional constraints on biological networks lead to complex topological patterns across multiple scales in their organization. A particular type of higher-order network feature that has received considerable interest is network motifs, defined as statistically regular subgraphs. These may implement fundamental logical and computational circuits and are referred to as “building blocks of complex networks”. Their well-defined structures and small sizes also enable the testing of their functions in synthetic and natural biological experiments. Here, we develop a framework for motif mining based on lossless network compression using subgraph contractions. This provides an alternative definition of motif significance which allows us to compare different motifs and select the collectively most significant set of motifs as well as other prominent network features in terms of their combined compression of the network. Our approach inherently accounts for multiple testing and correlations between subgraphs and does not rely on a priori specification of an appropriate null model. It thus overcomes common problems in hypothesis testing-based motif analysis and guarantees robust statistical inference. We validate our methodology on numerical data and then apply it on synaptic-resolution biological neural networks, as a medium for comparative connectomics, by evaluating their respective compressibility and characterize their inferred circuit motifs.
- 10 May 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (5) , L052105
Approximate information for efficient exploration-exploitation strategies
This paper addresses the exploration-exploitation dilemma inherent in decision-making, focusing on multiarmed bandit problems. These involve an agent deciding whether to exploit current knowledge for immediate gains or explore new avenues for potential long-term rewards. We here introduce a class of algorithms, approximate information maximization (AIM), which employs a carefully chosen analytical approximation to the gradient of the entropy to choose which arm to pull at each point in time. AIM matches the performance of Thompson sampling, which is known to be asymptotically optimal, as well as that of Infomax from which it derives. AIM thus retains the advantages of Infomax while also offering enhanced computational speed, tractability, and ease of implementation. In particular, we demonstrate how to apply it to a 50-armed bandit game. Its expression is tunable, which allows for specific optimization in various settings, making it possible to surpass the performance of Thompson sampling at short and intermediary times.
- 10 May 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (5) , L052105
Approximate information for efficient exploration-exploitation strategies
This paper addresses the exploration-exploitation dilemma inherent in decision-making, focusing on multiarmed bandit problems. These involve an agent deciding whether to exploit current knowledge for immediate gains or explore new avenues for potential long-term rewards. We here introduce a class of algorithms, approximate information maximization (AIM), which employs a carefully chosen analytical approximation to the gradient of the entropy to choose which arm to pull at each point in time. AIM matches the performance of Thompson sampling, which is known to be asymptotically optimal, as well as that of Infomax from which it derives. AIM thus retains the advantages of Infomax while also offering enhanced computational speed, tractability, and ease of implementation. In particular, we demonstrate how to apply it to a 50-armed bandit game. Its expression is tunable, which allows for specific optimization in various settings, making it possible to surpass the performance of Thompson sampling at short and intermediary times.
- Open Access
Statistical signature of subtle behavioural changes in large-scale behavioural assays
The central nervous system can generate various behaviours, including motor responses, which we can observe through video recordings. Recent advancements in genetics, automated behavioural acquisition at scale, and machine learning enable us to link behaviours to their underlying neural mechanisms causally. Moreover, in some animals, such as the Drosophila larva, this mapping is possible at unprecedented scales of millions of animals and single neurons, allowing us to identify the neural circuits generating particular behaviours. These high-throughput screening efforts are invaluable, linking the activation or suppression of specific neurons to behavioural patterns in millions of animals. This provides a rich dataset to explore how diverse nervous system responses can be to the same stimuli. However, challenges remain in identifying subtle behaviours from these large datasets, including immediate and delayed responses to neural activation or suppression, and understanding these behaviours on a large scale. We introduce several statistically robust methods for analyzing behavioural data in response to these challenges: 1) A generative physical model that regularizes the inference of larval shapes across the entire dataset. 2) An unsupervised kernel-based method for statistical testing in learned behavioural spaces aimed at detecting subtle deviations in behaviour. 3) A generative model for larval behavioural sequences, providing a benchmark for identifying complex behavioural changes. 4) A comprehensive analysis technique using suffix trees to categorize genetic lines into clusters based on common action sequences. We showcase these methodologies through a behavioural screen focused on responses to an air puff, analyzing data from 280,716 larvae across 568 genetic lines. Author Summary: There is a significant gap in understanding between the architecture of neural circuits and the mechanisms of action selection and behaviour generation. Drosophila larvae have emerged as an ideal platform for simultaneously probing behaviour and the underlying neuronal computation [1]. Modern genetic tools allow efficient activation or silencing of individual and small groups of neurons. Combining these techniques with standardized stimuli over thousands of individuals makes it possible to relate neurons to behaviour causally. However, extracting these relationships from massive and noisy recordings requires the development of new statistically robust approaches. We introduce a suite of statistical methods that utilize individual behavioural data and the overarching structure of the behavioural screen to deduce subtle behavioural changes from raw data. Given our study’s extensive number of larvae, addressing and preempting potential challenges in body shape recognition is critical for enhancing behaviour detection. To this end, we have adopted a physics-informed inference model. Our first group of techniques enables robust statistical analysis within a learned continuous behaviour latent space, facilitating the detection of subtle behavioural shifts relative to reference genetic lines. A second array of methods probes for subtle variations in action sequences by comparing them to a bespoke generative model. Together, these strategies have enabled us to construct representations of behavioural patterns specific to a lineage and identify a roster of ”hit” neurons with the potential to influence behaviour subtly.
Open AccessStatistical signature of subtle behavioural changes in large-scale behavioural assays
The central nervous system can generate various behaviours, including motor responses, which we can observe through video recordings. Recent advancements in genetics, automated behavioural acquisition at scale, and machine learning enable us to link behaviours to their underlying neural mechanisms causally. Moreover, in some animals, such as the Drosophila larva, this mapping is possible at unprecedented scales of millions of animals and single neurons, allowing us to identify the neural circuits generating particular behaviours. These high-throughput screening efforts are invaluable, linking the activation or suppression of specific neurons to behavioural patterns in millions of animals. This provides a rich dataset to explore how diverse nervous system responses can be to the same stimuli. However, challenges remain in identifying subtle behaviours from these large datasets, including immediate and delayed responses to neural activation or suppression, and understanding these behaviours on a large scale. We introduce several statistically robust methods for analyzing behavioural data in response to these challenges: 1) A generative physical model that regularizes the inference of larval shapes across the entire dataset. 2) An unsupervised kernel-based method for statistical testing in learned behavioural spaces aimed at detecting subtle deviations in behaviour. 3) A generative model for larval behavioural sequences, providing a benchmark for identifying complex behavioural changes. 4) A comprehensive analysis technique using suffix trees to categorize genetic lines into clusters based on common action sequences. We showcase these methodologies through a behavioural screen focused on responses to an air puff, analyzing data from 280,716 larvae across 568 genetic lines. Author Summary: There is a significant gap in understanding between the architecture of neural circuits and the mechanisms of action selection and behaviour generation. Drosophila larvae have emerged as an ideal platform for simultaneously probing behaviour and the underlying neuronal computation [1]. Modern genetic tools allow efficient activation or silencing of individual and small groups of neurons. Combining these techniques with standardized stimuli over thousands of individuals makes it possible to relate neurons to behaviour causally. However, extracting these relationships from massive and noisy recordings requires the development of new statistically robust approaches. We introduce a suite of statistical methods that utilize individual behavioural data and the overarching structure of the behavioural screen to deduce subtle behavioural changes from raw data. Given our study’s extensive number of larvae, addressing and preempting potential challenges in body shape recognition is critical for enhancing behaviour detection. To this end, we have adopted a physics-informed inference model. Our first group of techniques enables robust statistical analysis within a learned continuous behaviour latent space, facilitating the detection of subtle behavioural shifts relative to reference genetic lines. A second array of methods probes for subtle variations in action sequences by comparing them to a bespoke generative model. Together, these strategies have enabled us to construct representations of behavioural patterns specific to a lineage and identify a roster of ”hit” neurons with the potential to influence behaviour subtly.
- Open Access
- 2 February 2023
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 19 (2) , e1010088
Simulation-based inference for non-parametric statistical comparison of biomolecule dynamics
Numerous models have been developed to account for the complex properties of the random walks of biomolecules. However, when analysing experimental data, conditions are rarely met to ensure model identification. The dynamics may simultaneously be influenced by spatial and temporal heterogeneities of the environment, out-of-equilibrium fluxes and conformal changes of the tracked molecules. Recorded trajectories are often too short to reliably discern such multi-scale dynamics, which precludes unambiguous assessment of the type of random walk and its parameters. Furthermore, the motion of biomolecules may not be well described by a single, canonical random walk model. Here, we develop a two-step statistical testing scheme for comparing biomolecule dynamics observed in different experimental conditions without having to identify or make strong prior assumptions about the model generating the recorded random walks. We first train a graph neural network to perform simulation-based inference and thus learn a rich summary statistics vector describing individual trajectories. We then compare trajectories obtained in different biological conditions using a non-parametric maximum mean discrepancy (MMD) statistical test on their so-obtained summary statistics. This procedure allows us to characterise sets of random walks regardless of their generating models, without resorting to model-specific physical quantities or estimators. We first validate the relevance of our approach on numerically simulated trajectories. This demonstrates both the statistical power of the MMD test and the descriptive power of the learnt summary statistics compared to estimates of physical quantities. We then illustrate the ability of our framework to detect changes in α-synuclein dynamics at synapses in cultured cortical neurons, in response to membrane depolarisation, and show that detected differences are largely driven by increased protein mobility in the depolarised state, in agreement with previous findings. The method provides a means of interpreting the differences it detects in terms of single trajectory characteristics. Finally, we emphasise the interest of performing various comparisons to probe the heterogeneity of experimentally acquired datasets at different levels of granularity (e.g., biological replicates, fields of view, and organelles).
- 2 February 2023
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 19 (2) , e1010088
Open AccessSimulation-based inference for non-parametric statistical comparison of biomolecule dynamics
Numerous models have been developed to account for the complex properties of the random walks of biomolecules. However, when analysing experimental data, conditions are rarely met to ensure model identification. The dynamics may simultaneously be influenced by spatial and temporal heterogeneities of the environment, out-of-equilibrium fluxes and conformal changes of the tracked molecules. Recorded trajectories are often too short to reliably discern such multi-scale dynamics, which precludes unambiguous assessment of the type of random walk and its parameters. Furthermore, the motion of biomolecules may not be well described by a single, canonical random walk model. Here, we develop a two-step statistical testing scheme for comparing biomolecule dynamics observed in different experimental conditions without having to identify or make strong prior assumptions about the model generating the recorded random walks. We first train a graph neural network to perform simulation-based inference and thus learn a rich summary statistics vector describing individual trajectories. We then compare trajectories obtained in different biological conditions using a non-parametric maximum mean discrepancy (MMD) statistical test on their so-obtained summary statistics. This procedure allows us to characterise sets of random walks regardless of their generating models, without resorting to model-specific physical quantities or estimators. We first validate the relevance of our approach on numerically simulated trajectories. This demonstrates both the statistical power of the MMD test and the descriptive power of the learnt summary statistics compared to estimates of physical quantities. We then illustrate the ability of our framework to detect changes in α-synuclein dynamics at synapses in cultured cortical neurons, in response to membrane depolarisation, and show that detected differences are largely driven by increased protein mobility in the depolarised state, in agreement with previous findings. The method provides a means of interpreting the differences it detects in terms of single trajectory characteristics. Finally, we emphasise the interest of performing various comparisons to probe the heterogeneity of experimentally acquired datasets at different levels of granularity (e.g., biological replicates, fields of view, and organelles).
- Open Access
Randomized reference models for temporal networks
Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated topologies and dynamics. This makes their analysis particularly challenging. Randomized reference models (RRMs) have emerged as a general and versatile toolbox for studying such systems. Defined as random networks with given features constrained to match those of an input (empirical) network, they may, for example, be used to identify important features of empirical networks and their effects on dynamical processes unfolding in the network. RRMs are typically implemented as procedures that reshuffle an empirical network, making them very generally applicable. However, the effects of most shuffling procedures on network features remain poorly understood, rendering their use nontrivial and susceptible to misinterpretation. Here we propose a unified framework for classifying and understanding microcanonical RRMs (MRRMs) that sample networks with uniform probability. Focusing on temporal networks, we survey applications of MRRMs found in the literature, and we use this framework to build a taxonomy of MRRMs that proposes a canonical naming convention, classifies them, and deduces their effects on a range of important network features. We furthermore show that certain classes of MRRMs may be applied in sequential composition to generate new MRRMs from the existing ones surveyed in this article. We finally provide a tutorial showing how to apply a series of MRRMs to analyze how different network features affect a dynamic process in an empirical temporal network.
Open AccessRandomized reference models for temporal networks
Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated topologies and dynamics. This makes their analysis particularly challenging. Randomized reference models (RRMs) have emerged as a general and versatile toolbox for studying such systems. Defined as random networks with given features constrained to match those of an input (empirical) network, they may, for example, be used to identify important features of empirical networks and their effects on dynamical processes unfolding in the network. RRMs are typically implemented as procedures that reshuffle an empirical network, making them very generally applicable. However, the effects of most shuffling procedures on network features remain poorly understood, rendering their use nontrivial and susceptible to misinterpretation. Here we propose a unified framework for classifying and understanding microcanonical RRMs (MRRMs) that sample networks with uniform probability. Focusing on temporal networks, we survey applications of MRRMs found in the literature, and we use this framework to build a taxonomy of MRRMs that proposes a canonical naming convention, classifies them, and deduces their effects on a range of important network features. We furthermore show that certain classes of MRRMs may be applied in sequential composition to generate new MRRMs from the existing ones surveyed in this article. We finally provide a tutorial showing how to apply a series of MRRMs to analyze how different network features affect a dynamic process in an empirical temporal network.
- Top Cited Papers
- 3 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 64 (4) , 763-830
Randomized Reference Models for Temporal Networks
Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non...
- 3 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 64 (4) , 763-830
Top Cited PapersRandomized Reference Models for Temporal Networks
Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non...
- 28 April 2022
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 38 (11) , 3149-3150
TRamWAy: mapping physical properties of individual biomolecule random motion in large-scale single-particle tracking experiments
Motivation: Single-molecule localization microscopy allows studying the dynamics of biomolecules in cells and resolving the biophysical properties of the molecules and their environment underlying cellular function. With the continuously growing amount of data produced by individual experiments, the computational cost of quantifying these properties is increasingly becoming the bottleneck of single-molecule analysis. Mining these data requires an integrated and efficient analysis toolbox.Results: We introduce TRamWAy, a modular Python library that features: (i) a conservative tracking procedure for localization data, (ii) a range of sampling techniques for meshing the spatio-temporal support of the data, (iii) computationally efficient solvers for inverse models, with the option of plugging in user-defined functions and (iv) a collection of analysis tools and a simple web-based interface.Availability and implementation: TRamWAy is a Python library and can be installed with pip and conda. The source code is available at https://github.com/DecBayComp/TRamWAy.
- 28 April 2022
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 38 (11) , 3149-3150
TRamWAy: mapping physical properties of individual biomolecule random motion in large-scale single-particle tracking experiments
Motivation: Single-molecule localization microscopy allows studying the dynamics of biomolecules in cells and resolving the biophysical properties of the molecules and their environment underlying cellular function. With the continuously growing amount of data produced by individual experiments, the computational cost of quantifying these properties is increasingly becoming the bottleneck of single-molecule analysis. Mining these data requires an integrated and efficient analysis toolbox.Results: We introduce TRamWAy, a modular Python library that features: (i) a conservative tracking procedure for localization data, (ii) a range of sampling techniques for meshing the spatio-temporal support of the data, (iii) computationally efficient solvers for inverse models, with the option of plugging in user-defined functions and (iv) a collection of analysis tools and a simple web-based interface.Availability and implementation: TRamWAy is a Python library and can be installed with pip and conda. The source code is available at https://github.com/DecBayComp/TRamWAy.
- Open Access
A maximum mean discrepancy approach reveals subtle changes in α -synuclein dynamics
Numerous models have been developed to account for the complex properties of the random walks of biomolecules. However, when analysing experimental data, conditions are rarely met to ensure model identification. The dynamics may simultaneously be influenced by spatial and temporal heterogeneities of the environment, out-of-equilibrium fluxes and conformal changes of the tracked molecules. Recorded trajectories are often too short to reliably discern such multi-scale dynamics, which precludes unambiguous assessment of the type of random walk and its parameters. Furthermore, the motion of biomolecules may not be well described by a single, canonical random walk model. Here, we develop a methodology for comparing biomolecule dynamics observed in different experimental conditions without beforehand identifying the model generating the recorded random walks. We introduce a two-step statistical testing scheme. We first use simulation-based inference to train a graph neural network to learn a fixed-length latent representation of recorded random walks. As a second step, we use a maximum mean discrepancy statistical test on the vectors of learnt features to compare biological conditions. This procedure allows us to characterise sets of random walks regardless of their generating models. We initially tested our approach on numerical trajectories. We then demonstrated its ability to detect changes in α -synuclein dynamics at synapses in cultured cortical neurons in response to membrane depolarisation. Using our methodology, we identify the domains in the latent space where the variations between conditions are the most significant, which provides a way of interpreting the detected differences in terms of single trajectory characteristics. Our data show that changes in α -synuclein dynamics between the chosen conditions are largely driven by increased protein mobility in the depolarised state. Author summary: The continuous refinement of methods for single molecule tracking in live cells advance our understanding of how biomolecules move inside cells. Analysing the trajectories of single molecules is complicated by their highly erratic and noisy nature and thus requires the use of statistical models of their motion. However, it is often not possible to unambiguously determine a model from a set of short and noisy trajectories. Furthermore, the heterogeneous nature of the cellular environment means that the molecules’ motion is often not properly described by a single model. In this paper we develop a new statistical testing scheme to detect changes in biomolecule dynamics within organelles without needing to identify a model of their motion. We train a graph neural network on large-scale simulations of random walks to learn a latent representation that captures relevant physical properties of a trajectory. We use a kernel-based statistical test within that latent space to compare the properties of two sets of trajectories recorded under different biological conditions. We apply our approach to detect differences in the dynamics of α -synuclein, a presynaptic protein, in axons and boutons during synaptic stimulation. This represents an important step towards automated single-molecule-based read-out of pharmacological action.
Open AccessA maximum mean discrepancy approach reveals subtle changes in α -synuclein dynamics
Numerous models have been developed to account for the complex properties of the random walks of biomolecules. However, when analysing experimental data, conditions are rarely met to ensure model identification. The dynamics may simultaneously be influenced by spatial and temporal heterogeneities of the environment, out-of-equilibrium fluxes and conformal changes of the tracked molecules. Recorded trajectories are often too short to reliably discern such multi-scale dynamics, which precludes unambiguous assessment of the type of random walk and its parameters. Furthermore, the motion of biomolecules may not be well described by a single, canonical random walk model. Here, we develop a methodology for comparing biomolecule dynamics observed in different experimental conditions without beforehand identifying the model generating the recorded random walks. We introduce a two-step statistical testing scheme. We first use simulation-based inference to train a graph neural network to learn a fixed-length latent representation of recorded random walks. As a second step, we use a maximum mean discrepancy statistical test on the vectors of learnt features to compare biological conditions. This procedure allows us to characterise sets of random walks regardless of their generating models. We initially tested our approach on numerical trajectories. We then demonstrated its ability to detect changes in α -synuclein dynamics at synapses in cultured cortical neurons in response to membrane depolarisation. Using our methodology, we identify the domains in the latent space where the variations between conditions are the most significant, which provides a way of interpreting the detected differences in terms of single trajectory characteristics. Our data show that changes in α -synuclein dynamics between the chosen conditions are largely driven by increased protein mobility in the depolarised state. Author summary: The continuous refinement of methods for single molecule tracking in live cells advance our understanding of how biomolecules move inside cells. Analysing the trajectories of single molecules is complicated by their highly erratic and noisy nature and thus requires the use of statistical models of their motion. However, it is often not possible to unambiguously determine a model from a set of short and noisy trajectories. Furthermore, the heterogeneous nature of the cellular environment means that the molecules’ motion is often not properly described by a single model. In this paper we develop a new statistical testing scheme to detect changes in biomolecule dynamics within organelles without needing to identify a model of their motion. We train a graph neural network on large-scale simulations of random walks to learn a latent representation that captures relevant physical properties of a trajectory. We use a kernel-based statistical test within that latent space to compare the properties of two sets of trajectories recorded under different biological conditions. We apply our approach to detect differences in the dynamics of α -synuclein, a presynaptic protein, in axons and boutons during synaptic stimulation. This represents an important step towards automated single-molecule-based read-out of pharmacological action.
- Open Access
- 21 February 2022
- Published by Springer Nature in Nature Medicine
- Vol. 28 (3) , 517-527
Hematopoietic stem cell transplantation chemotherapy causes microglia senescence and peripheral macrophage engraftment in the brain
Hematopoietic stem cell transplantation (HSCT) is a therapy used for multiple malignant and nonmalignant diseases, with chemotherapy used for pretransplantation myeloablation. The post-HSCT brain contains peripheral engrafted parenchymal macrophages, despite their absence in the normal brain, with the engraftment mechanism still undefined. Here we show that HSCT chemotherapy broadly disrupts mouse brain regenerative populations, including a permanent loss of adult neurogenesis. Microglial density was halved, causing microglial process expansion, coinciding with indicators of broad senescence. Although microglia expressed cell proliferation markers, they underwent cell cycle arrest in S phase with a majority expressing the senescence and antiapoptotic marker p21. In vivo single-cell tracking of microglia after recovery from chemical depletion showed loss of their regenerative capacity, subsequently replaced with donor macrophages. We propose that HSCT chemotherapy causes microglial senescence with a gradual decrease to a critical microglial density, providing a permissive niche for peripheral macrophage engraftment of the brain.
- 21 February 2022
- Published by Springer Nature in Nature Medicine
- Vol. 28 (3) , 517-527
Open AccessHematopoietic stem cell transplantation chemotherapy causes microglia senescence and peripheral macrophage engraftment in the brain
Hematopoietic stem cell transplantation (HSCT) is a therapy used for multiple malignant and nonmalignant diseases, with chemotherapy used for pretransplantation myeloablation. The post-HSCT brain contains peripheral engrafted parenchymal macrophages, despite their absence in the normal brain, with the engraftment mechanism still undefined. Here we show that HSCT chemotherapy broadly disrupts mouse brain regenerative populations, including a permanent loss of adult neurogenesis. Microglial density was halved, causing microglial process expansion, coinciding with indicators of broad senescence. Although microglia expressed cell proliferation markers, they underwent cell cycle arrest in S phase with a majority expressing the senescence and antiapoptotic marker p21. In vivo single-cell tracking of microglia after recovery from chemical depletion showed loss of their regenerative capacity, subsequently replaced with donor macrophages. We propose that HSCT chemotherapy causes microglial senescence with a gradual decrease to a critical microglial density, providing a permissive niche for peripheral macrophage engraftment of the brain.