James Nolen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
James Nolen has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Gautam Iyer
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213 USA
4 shared publications - Jianfeng Lu
Duke University
4 shared publications - Lenya Ryzhik
Department of Mathematics, Stanford University, Stanford, USA
3 shared publications - Andrew M. Stuart
Mathematics Institute Zeeman Building University of Warwick CV4 7AL Coventry England
2 shared publications - Antoine Gloria
Université Libre de Bruxelles (ULB)
2 shared publications - Daniel J. Lew
Department of Biology, Massachusetts Institute of Technology, Cambridge, MA 02139
2 shared publications
Latest Publications
- Open Access
Ratiometric signaling produces robust temporal integration for accurate cellular gradient sensing
Cells excel at interpreting noisy chemical gradients during fertilization, development, and immune responses, but the mechanisms underlying this remarkable ability remain poorly understood. Classical models for gradient sensing assume that information is derived solely from ligand-bound receptors, but cells can also utilize information from unbound receptors. Here, we first derive the physical limit for instantaneous gradient detection by a distribution of receptors on a sphere. Surprisingly, we find that a ratiometric biochemical strategy, which compares spatial distributions of active (bound) and inactive (unbound) receptors, can surpass this physical limit. Using theory and simulations, we show this enhancement stems from a local collective memory encoded by downstream proteins that average receptor states sampled over time. Such memory-driven averaging allows cells to reliably interpret gradient direction despite receptor scarcity or noisy conditions, demonstrating how ratiometric sensing mechanisms could broadly enhance cellular responses to directional cues from the environment. Significance Statement Cells detect chemical gradients using receptors on their surface to guide essential processes like fertilization, immune responses, and organismal development. However, chemical environments are often noisy and complex, and it remains unclear how cells can accurately interpret these signals. We show that by using information from inactive as well as active receptors, a cell can average each receptor’s state over time and store that information in a population of downstream signaling proteins near the receptor. This strategy improves gradient sensing accuracy even when receptors are scarce or gradients are noisy, offering a path to improved engineering of microscale biosensors or drug-delivery devices that can orient in complex chemical landscapes.
Open AccessRatiometric signaling produces robust temporal integration for accurate cellular gradient sensing
Cells excel at interpreting noisy chemical gradients during fertilization, development, and immune responses, but the mechanisms underlying this remarkable ability remain poorly understood. Classical models for gradient sensing assume that information is derived solely from ligand-bound receptors, but cells can also utilize information from unbound receptors. Here, we first derive the physical limit for instantaneous gradient detection by a distribution of receptors on a sphere. Surprisingly, we find that a ratiometric biochemical strategy, which compares spatial distributions of active (bound) and inactive (unbound) receptors, can surpass this physical limit. Using theory and simulations, we show this enhancement stems from a local collective memory encoded by downstream proteins that average receptor states sampled over time. Such memory-driven averaging allows cells to reliably interpret gradient direction despite receptor scarcity or noisy conditions, demonstrating how ratiometric sensing mechanisms could broadly enhance cellular responses to directional cues from the environment. Significance Statement Cells detect chemical gradients using receptors on their surface to guide essential processes like fertilization, immune responses, and organismal development. However, chemical environments are often noisy and complex, and it remains unclear how cells can accurately interpret these signals. We show that by using information from inactive as well as active receptors, a cell can average each receptor’s state over time and store that information in a population of downstream signaling proteins near the receptor. This strategy improves gradient sensing accuracy even when receptors are scarce or gradients are noisy, offering a path to improved engineering of microscale biosensors or drug-delivery devices that can orient in complex chemical landscapes.
- 8 June 2023
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 82 (2) , 359-390
Using Bernoulli maps to accelerate mixing of a random walk on the torus
We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is O ( 1 / ε 2 ) O(1/\varepsilon ^2) , where ε \varepsilon is the step size. Our main results show that for a class of Bernoulli maps, when the random walk is alternated with the Bernoulli map φ \varphi the mixing time becomes O ( | ln ε | ) O(\lvert \ln \varepsilon \rvert ) . We also study the dissipation time of this process, and obtain O ( | ln ε | ) O(\lvert \ln \varepsilon \rvert ) upper and lower bounds with explicit constants.
- 8 June 2023
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 82 (2) , 359-390
Using Bernoulli maps to accelerate mixing of a random walk on the torus
We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is O ( 1 / ε 2 ) O(1/\varepsilon ^2) , where ε \varepsilon is the step size. Our main results show that for a class of Bernoulli maps, when the random walk is alternated with the Bernoulli map φ \varphi the mixing time becomes O ( | ln ε | ) O(\lvert \ln \varepsilon \rvert ) . We also study the dissipation time of this process, and obtain O ( | ln ε | ) O(\lvert \ln \varepsilon \rvert ) upper and lower bounds with explicit constants.
- Open Access
Using Bernoulli maps to accelerate mixing of a random walk on the torus
We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/ε^2)$, where $ε$ is the step size. Our main results show that for a class of Bernoulli maps, when the random walk is alternated with the Bernoulli map $\varphi$ the mixing time becomes $O(|\ln ε|)$. We also study the \emph{dissipation time} of this process, and obtain $O(|\ln ε|)$ upper and lower bounds with explicit constants.Open AccessUsing Bernoulli maps to accelerate mixing of a random walk on the torus
We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/ε^2)$, where $ε$ is the step size. Our main results show that for a class of Bernoulli maps, when the random walk is alternated with the Bernoulli map $\varphi$ the mixing time becomes $O(|\ln ε|)$. We also study the \emph{dissipation time} of this process, and obtain $O(|\ln ε|)$ upper and lower bounds with explicit constants. - Open Access
The Fleming-Viot Process with McKean-Vlasov Dynamics
The Fleming-Viot particle system consists of $N$ identical particles diffusing in a domain $U \subset \mathbb{R}^d$. Whenever a particle hits the boundary $\partial U$, that particle jumps onto another particle in the interior. It is known that this system provides a particle representation for both the Quasi-Stationary Distribution (QSD) and the distribution conditioned on survival for a given diffusion killed at the boundary of its domain. We extend these results to the case of McKean-Vlasov dynamics. We prove that the law conditioned on survival of a given McKean-Vlasov process killed on the boundary of its domain may be obtained from the hydrodynamic limit of the corresponding Fleming-Viot particle system. We then show that if the target killed McKean-Vlasov process converges to a QSD as $t \rightarrow \infty$, such a QSD may be obtained from the stationary distributions of the corresponding $N$-particle Fleming-Viot system as $N\rightarrow\infty$.Open AccessThe Fleming-Viot Process with McKean-Vlasov Dynamics
The Fleming-Viot particle system consists of $N$ identical particles diffusing in a domain $U \subset \mathbb{R}^d$. Whenever a particle hits the boundary $\partial U$, that particle jumps onto another particle in the interior. It is known that this system provides a particle representation for both the Quasi-Stationary Distribution (QSD) and the distribution conditioned on survival for a given diffusion killed at the boundary of its domain. We extend these results to the case of McKean-Vlasov dynamics. We prove that the law conditioned on survival of a given McKean-Vlasov process killed on the boundary of its domain may be obtained from the hydrodynamic limit of the corresponding Fleming-Viot particle system. We then show that if the target killed McKean-Vlasov process converges to a QSD as $t \rightarrow \infty$, such a QSD may be obtained from the stationary distributions of the corresponding $N$-particle Fleming-Viot system as $N\rightarrow\infty$. - Open Access
Asymptotic behavior of branching diffusion processes in periodic media
We study the asymptotic behavior of branching diffusion processes in periodic media. For a super-critical branching process, we distinguish two types of behavior for the normalized number of particles in a bounded domain, depending on the distance of the domain from the region where the bulk of the particles is located. At distances that grow linearly in time, we observe intermittency (i.e., the $k$-th moment dominates the $k$-th power of the first moment for some $k$), while, at distances that grow sub-linearly in time, we show that all the moments converge. A key ingredient in our analysis is a sharp estimate of the transition kernel for the branching process, valid up to linear in time distances from the location of the initial particle.
Open AccessAsymptotic behavior of branching diffusion processes in periodic media
We study the asymptotic behavior of branching diffusion processes in periodic media. For a super-critical branching process, we distinguish two types of behavior for the normalized number of particles in a bounded domain, depending on the distance of the domain from the region where the bulk of the particles is located. At distances that grow linearly in time, we observe intermittency (i.e., the $k$-th moment dominates the $k$-th power of the first moment for some $k$), while, at distances that grow sub-linearly in time, we show that all the moments converge. A key ingredient in our analysis is a sharp estimate of the transition kernel for the branching process, valid up to linear in time distances from the location of the initial particle.
- Open Access
Quantitative Propagation of Chaos in the bimolecular chemical reaction-diffusion model
We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\in \mathbb{T}^d$, and the type $\Xi_t^i\in \{1,\cdots,n\}$. While $X_t^i$ is a standard (independent) diffusion process, the evolution of the type $\Xi_t^i$ is described by pairwise interactions between different particles under a series of chemical reactions described by a chemical reaction network. We prove that in the large particle limit the stochastic dynamics converges to a mean field limit which is described by a nonlocal reaction-diffusion partial differential equation. In particular, we obtain a quantitative propagation of chaos result for the interacting particle system. Our proof is based on the relative entropy method used recently by Jabin and Wang \cite{JW18}. The key ingredient of the relative entropy method is a large deviation estimate for a special partition function, which was proved previously by technical combinatorial estimates. We give a simple probabilistic proof based on a novel martingale argument.Open AccessQuantitative Propagation of Chaos in the bimolecular chemical reaction-diffusion model
We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\in \mathbb{T}^d$, and the type $\Xi_t^i\in \{1,\cdots,n\}$. While $X_t^i$ is a standard (independent) diffusion process, the evolution of the type $\Xi_t^i$ is described by pairwise interactions between different particles under a series of chemical reactions described by a chemical reaction network. We prove that in the large particle limit the stochastic dynamics converges to a mean field limit which is described by a nonlocal reaction-diffusion partial differential equation. In particular, we obtain a quantitative propagation of chaos result for the interacting particle system. Our proof is based on the relative entropy method used recently by Jabin and Wang \cite{JW18}. The key ingredient of the relative entropy method is a large deviation estimate for a special partition function, which was proved previously by technical combinatorial estimates. We give a simple probabilistic proof based on a novel martingale argument. - 1 January 2020
- Published by International Press of Boston in Communications in Mathematical Sciences
- Vol. 18 (7) , 1815-1862
Anomalous diffusion in comb-shaped domains and graphs
- 1 January 2020
- Published by International Press of Boston in Communications in Mathematical Sciences
- Vol. 18 (7) , 1815-1862
Anomalous diffusion in comb-shaped domains and graphs
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 52 (2) , 2098-2133
Quantitative Propagation of Chaos in a Bimolecular Chemical Reaction-Diffusion Model
We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\...- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 52 (2) , 2098-2133
Quantitative Propagation of Chaos in a Bimolecular Chemical Reaction-Diffusion Model
We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\...- Open Access
- 17 October 2019
- Published by Public Library of Science (PLoS) in PLOS Biology
- Vol. 17 (10) , e3000484
Ratiometric GPCR signaling enables directional sensing in yeast
Accurate detection of extracellular chemical gradients is essential for many cellular behaviors. Gradient sensing is challenging for small cells, which can experience little difference in ligand concentrations on the up-gradient and down-gradient sides of the cell. Nevertheless, the tiny cells of the yeast Saccharomyces cerevisiae reliably decode gradients of extracellular pheromones to find their mates. By imaging the behavior of polarity factors and pheromone receptors, we quantified the accuracy of initial polarization during mating encounters. We found that cells bias the orientation of initial polarity up-gradient, even though they have unevenly distributed receptors. Uneven receptor density means that the gradient of ligand-bound receptors does not accurately reflect the external pheromone gradient. Nevertheless, yeast cells appear to avoid being misled by responding to the fraction of occupied receptors rather than simply the concentration of ligand-bound receptors. Such ratiometric sensing also serves to amplify the gradient of active G protein. However, this process is quite error-prone, and initial errors are corrected during a subsequent indecisive phase in which polarity clusters exhibit erratic mobile behavior.
- 17 October 2019
- Published by Public Library of Science (PLoS) in PLOS Biology
- Vol. 17 (10) , e3000484
Open AccessRatiometric GPCR signaling enables directional sensing in yeast
Accurate detection of extracellular chemical gradients is essential for many cellular behaviors. Gradient sensing is challenging for small cells, which can experience little difference in ligand concentrations on the up-gradient and down-gradient sides of the cell. Nevertheless, the tiny cells of the yeast Saccharomyces cerevisiae reliably decode gradients of extracellular pheromones to find their mates. By imaging the behavior of polarity factors and pheromone receptors, we quantified the accuracy of initial polarization during mating encounters. We found that cells bias the orientation of initial polarity up-gradient, even though they have unevenly distributed receptors. Uneven receptor density means that the gradient of ligand-bound receptors does not accurately reflect the external pheromone gradient. Nevertheless, yeast cells appear to avoid being misled by responding to the fraction of occupied receptors rather than simply the concentration of ligand-bound receptors. Such ratiometric sensing also serves to amplify the gradient of active G protein. However, this process is quite error-prone, and initial errors are corrected during a subsequent indecisive phase in which polarity clusters exhibit erratic mobile behavior.
- Open Access
Anomalous diffusion in comb-shaped domains and graphs
In this paper we study the asymptotic behavior of Brownian motion in both comb-shaped planar domains, and comb-shaped graphs. We show convergence to a limiting process when both the spacing between the teeth \emph{and} the width of the teeth vanish at the same rate. The limiting process exhibits an anomalous diffusive behavior and can be described as a Brownian motion time-changed by the local time of an independent sticky Brownian motion. In the two dimensional setting the main technical step is an oscillation estimate for a Neumann problem, which we prove here using a probabilistic argument. In the one dimensional setting we provide both a direct SDE proof, and a proof using the trapped Brownian motion framework in Ben Arous \etal (Ann.\ Probab.\ '15).
Open AccessAnomalous diffusion in comb-shaped domains and graphs
In this paper we study the asymptotic behavior of Brownian motion in both comb-shaped planar domains, and comb-shaped graphs. We show convergence to a limiting process when both the spacing between the teeth \emph{and} the width of the teeth vanish at the same rate. The limiting process exhibits an anomalous diffusive behavior and can be described as a Brownian motion time-changed by the local time of an independent sticky Brownian motion. In the two dimensional setting the main technical step is an oscillation estimate for a Neumann problem, which we prove here using a probabilistic argument. In the one dimensional setting we provide both a direct SDE proof, and a proof using the trapped Brownian motion framework in Ben Arous \etal (Ann.\ Probab.\ '15).