Maxwell Schweiger

Maxwell Schweiger

Auto-generated profile, based on publicly available information

Maxwell Schweiger

Center for Biological Physics, Arizona State University, Tempe, AZ, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2024 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
PDF file
PPPedro Pessoa
Pedro Pessoa
MSMax Schweiger
Max Schweiger
SPSteve Presse
Steve Presse
Exact methods for the exponentiation of matrices of dimension N can be computationally expensive in terms of execution time (N3) and memory requirements (N2), not to mention numerical precision issues. A matrix often exponentiated in the natural sciences is the rate matrix. Here, we explore five methods to exponentiate rate matrices, some of which apply more broadly to other matrix types. Three of the methods leverage a mathematical analogy between computing matrix elements of a matrix exponential process and computing transition probabilities of a dynamical process (technically a Markov jump process, MJP, typically simulated using Gillespie). In doing so, we identify a novel MJP-based method relying on restricting the number of “trajectory” jumps that incurs improved computational scaling. We then discuss this method’s downstream implications on mixing properties of Monte Carlo posterior samplers. We also benchmark two other methods of matrix exponentiation valid for any matrix (beyond rate matrices and, more generally, positive definite matrices) related to solving differential equations: Runge–Kutta integrators and Krylov subspace methods. Under conditions where both the largest matrix element and the number of non-vanishing elements scale linearly with N—reasonable conditions for rate matrices often exponentiated—computational time scaling with the most competitive methods (Krylov and one of the MJP-based methods) reduces to N2 with total memory requirements of N.

23 October 2025 in iScience
Verified
Journal Article
Open access
PPPedro Pessoa
Pedro Pessoa
MSMax Schweiger
Max Schweiger
LXLance W.Q. Xu
Lance W.Q. Xu
TMTristan Manha
Tristan Manha
ASAyush Saurabh
Ayush Saurabh
SPSteve Presse
Steve Presse
Across the scientific realm, we find ourselves subtracting or dividing stochastic signals. For instance, consider a stochastic realization, x, generated from the addition or multiplication of two stochastic signals, a and b, namely x = a+b or x = ab. For the x = a+b example, a can be fluorescence background and b the signal of interest whose statistics are to be learned from the measured x. Similarly, when writing x = ab, a can be the illumination intensity and b the intensity due to the fluorescent molecules of interest. Yet dividing or subtracting stochastic signals amplifies noise, and we ask whether, using the statistics of a and the measurement of x as input, we can recover the statistics of b. Here, we show how normalizing flows can approximate the probability distribution over b, thereby avoiding subtraction or division altogether. This approach is implemented in our software package, NFdeconvolve, available on GitHub with tutorials available.

2 December 2025 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
MSM. Schweiger
M. Schweiger
ASA. Saurabh
A. Saurabh
SPSteve Presse
Steve Presse
Nature, as far as we know, evolves continuously through space and time. Yet, the ubiquitous hidden Markov model (HMM)—originally developed for discrete time and space analysis in natural language processing—remains a central tool in interpreting time series data drawn from physical systems. This raises a fundamental question: What are the implications of applying a discrete-state, discrete-time framework to analyze data generated by a continuously evolving system? Through synthetic data generated using Langevin dynamics in an effective potential, we explore under what circumstances HMMs yield interpretable results. Our analysis reveals that the discrete-state approximation acts primarily as an abstraction. As such, the inferred states visited in time often more closely reflecting the measurement protocol and modeling choices than features of the underlying physical potential. Crucially, we demonstrate that the states visited over the course of a time series recovered by the HMM can be tuned a priori by adjusting the data acquisition scheme. In fact, it is even possible to misleadingly and reproducibly recover “intermediate” states using different HMM tools for a system evolving in a single well potential. We conclude with a note of measured caution: while HMMs offer a mathematically elegant framework for time series inference, their use in physical modeling should be guided by an awareness of their limitations. In this light, we outline important generalizations of the HMM to continuous space and time and highlight the importance of a well calibrated measurement noise model.

28 May 2022 in bioRxiv
Verified
Preprint
Open access
PDF file
CMCamille Moyer
Camille Moyer
ZKZeliha Kilic
Zeliha Kilic
MSMax Schweiger
Max Schweiger
DSDouglas Shepherd
Douglas Shepherd
SPSteve Presse
Steve Presse
1 Gene networks, key toward understanding a cell’s regulatory response, underlie experimental observations of single cell transcriptional dynamics. While information on the gene network is encoded in RNA expression data, existing computational frameworks cannot currently infer gene networks from such data. Rather, gene networks—composed of gene states, their connectivities, and associated parameters—are currently deduced by pre-specifying gene state numbers and connectivity prior to learning associated rate parameters. As such, the correctness of gene networks cannot be independently assessed which can lead to strong biases. By contrast, here we propose a method to learn full distributions over gene states, state connectivities, and associated rate parameters, simultaneously and self-consistently from single molecule level RNA counts. Notably, our method propagates noise originating from fluctuating RNA counts over networks warranted by the data by treating networks themselves as random variables. We achieve this by operating within a Bayesian nonparametric paradigm. We demonstrate our method on the lacZ pathway in Escherichia coli cells, the STL1 pathway in Saccharomyces cerevisiae yeast cells, and verify its robustness on synthetic data.

9 November 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
RSRicky Sexton
Ricky Sexton
MFMohamadreza Fazel
Mohamadreza Fazel
MSMaxwell Schweiger
Maxwell Schweiger
SPSteve Presse
Steve Presse
OBOliver Beckstein
Oliver Beckstein
Molecular Dynamics (MD) simulations are a versatile tool to investigate the interactions of proteins within their environments, in particular of membrane proteins with the surrounding lipids. However, quantitative analysis of lipid-protein binding kinetics has remained challenging due to considerable noise and low frequency of long binding events, even in hundreds of microseconds of simulation data. Here we apply Bayesian nonparametrics to compute residue-resolved residence time distributions from MD trajectories. Such an analysis characterizes binding processes at different timescales (quantified by their kinetic off-rate) and assigns to each trajectory frame a probability of belonging to a specific process. In this way, we classify trajectory frames in an unsupervised manner and obtain, for example, different binding poses or molecular densities based on the timescale of the process. We demonstrate our approach by characterizing interactions of cholesterol with six different G-protein coupled receptors (A 2A AR, β 2 AR, CB 1 R, CB 2 R, CCK 1 R, CCK 2 R) simulated with coarse-grained MD simulations with the MARTINI model. The nonparametric Bayesian analysis allows us to connect the coarse binding time series data to the underlying molecular picture and, thus, not only infers accurate binding kinetics with error distributions from MD simulations but also describes molecular events responsible for the broad range of kinetic rates.

22 September 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
ARAlex Rojewski
Alex Rojewski
MSMaxwell Schweiger
Maxwell Schweiger
ISIoannis Sgouralis
Ioannis Sgouralis
MCMatthew Comstock
Matthew Comstock
SPSteve Presse
Steve Presse
Noisy time-series data is commonly collected from sources including Förster Resonance Energy Transfer experiments, patch clamp and force spectroscopy setups, among many others. Two of the most common paradigms for the detection of discrete transitions in such time-series data include: hidden Markov models (HMMs) and step-finding algorithms. HMMs, including their extensions to infinite state-spaces, inherently assume in analysis that holding times in discrete states visited are geometrically–or, loosely speaking in common language, exponentially–distributed. Thus the determination of step locations, especially in sparse and noisy data, is biased by HMMs toward identifying steps resulting in geometric holding times. In contrast, existing step-finding algorithms, while free of this restraint, often rely on ad hoc metrics to penalize steps recovered in time traces (by using various information criteria) and otherwise rely on approximate greedy algorithms to identify putative global optima. Here, instead, we devise a robust and general probabilistic (Bayesian) step-finding tool that neither relies on ad hoc metrics to penalize step numbers nor assumes geometric holding times in each state. As the number of steps themselves in a time-series are, a priori unknown, we treat these within a Bayesian nonparametric (BNP) paradigm. We find that the method developed, Bayesian Nonparametric Step (BNP-Step), accurately determines the number and location of transitions between discrete states without any assumed kinetic model and learns the emission distribution characteristic of each state. In doing so, we verify that BNP-Step can analyze sparser data sets containing higher noise and more closely-spaced states than otherwise resolved by current state-of-the-art methods. What is more, BNP-Step rigorously propagates measurement uncertainty into uncertainty over state transition locations, numbers, and emission levels as characterized by the posterior. We demonstrate the performance of BNP-Step on both synthetic data as well as data drawn from force spectroscopy experiments. SIGNIFICANCE: Many time-series data sets exist which are challenging to analyze with current state-of-the-art methods, either because they contain excessive noise or because they violate one or more assumptions inherent to the chosen analysis method. To our knowledge, BNP-Step is the first time-series analysis algorithm which leverages Bayesian nonparametrics to learn the number and location of transitions between states and the emission levels associated to each state, while providing rigorous estimates of uncertainty for the learned quantities. We anticipate our algorithm will allow analysis of data sets at levels of noise or sparsity beyond what current state-of-the-art methods allow, and could potentially reveal previously unknown features in data sets analyzed using existing methods.