Zhennan Zhou
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
Zhennan Zhou has a total of 107 co-authors. Here are the top co-authors by number of shared publications:
- Jian-Guo Liu
Department of Mathematics, Department of Physics, Duke University, Durham, NC 27708, USA
11 shared publications - Jianfeng Lu
Duke University
8 shared publications - Xu'An Dou
Peking Univ, Beijing Int Ctr Math Res, Beijing 100871, Peoples R China
7 shared publications - Benoît Perthame
Sorbonne Université, CNRS, Université Paris-Cité, Inria, Laboratoire “Jacques-Louis Lions,” Paris, France
6 shared publications - Delphine Salort
Sorbonne Université, CNRS, Université Paris Cité, Laboratoire Jacques-Louis Lions
6 shared publications Xuda Ye
6 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (5) , 4393-4429
An infinite-times renewal equation
In neuroscience, the time elapsed since the last discharge has been used to predict the probability of the next discharge. Such predictions can be improved taking into account the last two discharge times, and preferentially more. Such multi-times renewal processes arise in many other areas, and there is no universal limitation on the number of times to be used. This observation leads us to study the infinite-times renewal equation as a simple model to understand the meaning and properties of such partial differential equations depending on an infinite number of variables. This model also has a solid connection to the theory of Markov chain of infinite order. We rigorously construct solutions for the infinite-times renewal equation via the limit N→∞ of N-times equations, establishing notions of hierarchy and measure solutions. We then investigate the long-time convergence, overcoming the difficulty of vanishing rates as N→∞ and use two methods: a refined Doeblin analysis and a coupling approach with a specific distance yielding uniform-in-N convergences. This work provides a rigorous framework for the forward Kolmogorov equation of the infinite-times renewal process, demonstrates its approximation by finite-dimensional Markov processes, and aids in analyzing its ergodic or mixing properties, contributing insights relevant to infinite-dimensional dynamics.
- 1 October 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (5) , 4393-4429
An infinite-times renewal equation
In neuroscience, the time elapsed since the last discharge has been used to predict the probability of the next discharge. Such predictions can be improved taking into account the last two discharge times, and preferentially more. Such multi-times renewal processes arise in many other areas, and there is no universal limitation on the number of times to be used. This observation leads us to study the infinite-times renewal equation as a simple model to understand the meaning and properties of such partial differential equations depending on an infinite number of variables. This model also has a solid connection to the theory of Markov chain of infinite order. We rigorously construct solutions for the infinite-times renewal equation via the limit N→∞ of N-times equations, establishing notions of hierarchy and measure solutions. We then investigate the long-time convergence, overcoming the difficulty of vanishing rates as N→∞ and use two methods: a refined Doeblin analysis and a coupling approach with a specific distance yielding uniform-in-N convergences. This work provides a rigorous framework for the forward Kolmogorov equation of the infinite-times renewal process, demonstrates its approximation by finite-dimensional Markov processes, and aids in analyzing its ergodic or mixing properties, contributing insights relevant to infinite-dimensional dynamics.
- 8 July 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 565
Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime
- 8 July 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 565
Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime
- Open Access
- 1 June 2026
- Published by Elsevier in SSRN Electronic Journal
A Lagrangian Approach to Optimal Randomization
We develop an efficient method for solving non-convex constrained optimization problems that are pervasive in economics. The optimal solution to these problems often involves randomization. We employ a Lagrangian framework and prove that the value of the saddle point characterizing the optimal random solution equals the value of the deterministic dual problem. Our algorithm solves this dual via subgradient descent and recovers the optimal random solution directly from deterministic optima computed along the iterations. For many non-convex economic problems, our method is orders of magnitude faster than linear programming, making previously intractable lottery problems feasible. As an application, we solve for optimal Mirrleesian income taxation with multi-dimensional types. We show that heterogeneity in productivity and Frisch elasticity can make randomization welfare-improving over the optimal deterministic schedule.
- 1 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Lagrangian Approach to Optimal Randomization
We develop an efficient method for solving non-convex constrained optimization problems that are pervasive in economics. The optimal solution to these problems often involves randomization. We employ a Lagrangian framework and prove that the value of the saddle point characterizing the optimal random solution equals the value of the deterministic dual problem. Our algorithm solves this dual via subgradient descent and recovers the optimal random solution directly from deterministic optima computed along the iterations. For many non-convex economic problems, our method is orders of magnitude faster than linear programming, making previously intractable lottery problems feasible. As an application, we solve for optimal Mirrleesian income taxation with multi-dimensional types. We show that heterogeneity in productivity and Frisch elasticity can make randomization welfare-improving over the optimal deterministic schedule.
- 6 May 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (17)
Stable memory kernel coupling theory for quantum dynamics: Projection-based and continued fraction methods
We introduce two complementary formulations within memory kernel coupling theory (MKCT) for non-Markovian quantum dynamics: a projection-based method (PMKCT) in the time domain and a continued fraction representation (CF-MKCT) in the frequency domain. The PMKCT operates on the matrix representation of MKCT and enforces asymptotic stability by removing unstable spectral components through orthogonal projection. The CF-MKCT yields a rapidly convergent representation, achieving high accuracy with only N ∼ 8 moments while preserving numerical stability by construction; the inverse Fourier transformation back to the time domain naturally yields a stable solution and converges rapidly with relatively few moments. Together, these two formulations provide a stable, accurate, and versatile framework for simulating non-Markovian quantum dynamics. Benchmark calculations on the spin-boson model with Ohmic spectral densities show excellent agreement with numerically exact results.
- 6 May 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (17)
Stable memory kernel coupling theory for quantum dynamics: Projection-based and continued fraction methods
We introduce two complementary formulations within memory kernel coupling theory (MKCT) for non-Markovian quantum dynamics: a projection-based method (PMKCT) in the time domain and a continued fraction representation (CF-MKCT) in the frequency domain. The PMKCT operates on the matrix representation of MKCT and enforces asymptotic stability by removing unstable spectral components through orthogonal projection. The CF-MKCT yields a rapidly convergent representation, achieving high accuracy with only N ∼ 8 moments while preserving numerical stability by construction; the inverse Fourier transformation back to the time domain naturally yields a stable solution and converges rapidly with relatively few moments. Together, these two formulations provide a stable, accurate, and versatile framework for simulating non-Markovian quantum dynamics. Benchmark calculations on the spin-boson model with Ohmic spectral densities show excellent agreement with numerically exact results.
- Open Access
- 11 April 2026
- Published by Elsevier in SSRN Electronic Journal
Resolving the Blow-Up: A Time-Dilated Numerical Framework for Multiple Firing Events in Mean-Field Neuronal Networks
In large-scale excitatory neuronal networks, rapid synchronization manifests as multiple firing events (MFEs), mathematically characterized by a finite-time blow-up of the neuronal firing rate in the mean-field Fokker-Planck equation. Standard numerical methods struggle to resolve this singularity due to the divergent boundary flux and the instantaneous nature of the population voltage reset. In this work, we propose a robust multiscale numerical framework based on time dilation. By transforming the governing equation into a dilated timescale proportional to the firing activity, we desingularize the blow-up, effectively stretching the instantaneous synchronization event into a resolved mesoscopic process. This approach is shown to be physically consistent with the microscopic cascade mechanism underlying MFEs and the system's inherent fragility. To implement this numerically, we develop a hybrid scheme that utilizes a mesh-independent flux criterion to switch between timescales and a semi-analytical moving Gaussian method to accurately evolve the post-blowup Dirac mass. Numerical benchmarks demonstrate that our solver not only captures steady states with high accuracy but also efficiently reproduces periodic MFEs, matching Monte Carlo simulations without the severe time-step restrictions associated with particle cascades.
- 11 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessResolving the Blow-Up: A Time-Dilated Numerical Framework for Multiple Firing Events in Mean-Field Neuronal Networks
In large-scale excitatory neuronal networks, rapid synchronization manifests as multiple firing events (MFEs), mathematically characterized by a finite-time blow-up of the neuronal firing rate in the mean-field Fokker-Planck equation. Standard numerical methods struggle to resolve this singularity due to the divergent boundary flux and the instantaneous nature of the population voltage reset. In this work, we propose a robust multiscale numerical framework based on time dilation. By transforming the governing equation into a dilated timescale proportional to the firing activity, we desingularize the blow-up, effectively stretching the instantaneous synchronization event into a resolved mesoscopic process. This approach is shown to be physically consistent with the microscopic cascade mechanism underlying MFEs and the system's inherent fragility. To implement this numerically, we develop a hybrid scheme that utilizes a mesh-independent flux criterion to switch between timescales and a semi-analytical moving Gaussian method to accurately evolve the post-blowup Dirac mass. Numerical benchmarks demonstrate that our solver not only captures steady states with high accuracy but also efficiently reproduces periodic MFEs, matching Monte Carlo simulations without the severe time-step restrictions associated with particle cascades.
- Open Access
- 26 February 2026
- Published by Elsevier in SSRN Electronic Journal
A Stabilized Numerical Framework for Necrotic Tumor Growth via Coupled Boundary Integral and Obstacle Solvers
We present a robust computational framework for Hele-Shaw tumor growth with necrotic cores, a problem identified as the incompressible limit of the Porous Media Equation. Simulating this system presents a fundamental challenge: while the outer boundary evolves via advection, the inner necrotic interface is defined by an {obstacle problem} and {lacks an explicit advection structure}, causing standard schemes to fail. To address this, we introduce a stabilized predictor-corrector strategy that iteratively resolves the bidirectional coupling between the nutrient-pressure fields and the domain geometry, ensuring robust time-stepping for both the advection-driven outer surface and the obstacle-defined necrotic core. We establish rigorous convergence theory for the single-interface case and demonstrate the method's robustness in capturing the topological transition of necrotic core nucleation and complex geometric evolution.
- 26 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Stabilized Numerical Framework for Necrotic Tumor Growth via Coupled Boundary Integral and Obstacle Solvers
We present a robust computational framework for Hele-Shaw tumor growth with necrotic cores, a problem identified as the incompressible limit of the Porous Media Equation. Simulating this system presents a fundamental challenge: while the outer boundary evolves via advection, the inner necrotic interface is defined by an {obstacle problem} and {lacks an explicit advection structure}, causing standard schemes to fail. To address this, we introduce a stabilized predictor-corrector strategy that iteratively resolves the bidirectional coupling between the nutrient-pressure fields and the domain geometry, ensuring robust time-stepping for both the advection-driven outer surface and the obstacle-defined necrotic core. We establish rigorous convergence theory for the single-interface case and demonstrate the method's robustness in capturing the topological transition of necrotic core nucleation and complex geometric evolution.
- Open Access
A Stabilized Numerical Framework for Necrotic Tumor Growth via Coupled Boundary Integral and Obstacle Solvers
We present a robust computational framework for Hele-Shaw tumor growth with necrotic cores, a problem identified as the incompressible limit of the Porous Media Equation. Simulating this system presents a fundamental challenge: while the outer boundary evolves via advection, the inner necrotic interface is defined by an obstacle problem and lacks an explicit advection structure, causing standard schemes to fail. To address this, we introduce a stabilized predictor-corrector strategy that iteratively resolves the bidirectional coupling between the nutrient-pressure fields and the domain geometry, ensuring robust time-stepping for both the advection-driven outer surface and the obstacle-defined necrotic core. We establish rigorous convergence theory for the single-interface case and demonstrate the method's robustness in capturing the topological transition of necrotic core nucleation and complex geometric evolution.
Open AccessA Stabilized Numerical Framework for Necrotic Tumor Growth via Coupled Boundary Integral and Obstacle Solvers
We present a robust computational framework for Hele-Shaw tumor growth with necrotic cores, a problem identified as the incompressible limit of the Porous Media Equation. Simulating this system presents a fundamental challenge: while the outer boundary evolves via advection, the inner necrotic interface is defined by an obstacle problem and lacks an explicit advection structure, causing standard schemes to fail. To address this, we introduce a stabilized predictor-corrector strategy that iteratively resolves the bidirectional coupling between the nutrient-pressure fields and the domain geometry, ensuring robust time-stepping for both the advection-driven outer surface and the obstacle-defined necrotic core. We establish rigorous convergence theory for the single-interface case and demonstrate the method's robustness in capturing the topological transition of necrotic core nucleation and complex geometric evolution.
- Open Access
Frozen Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime
Simulating Markovian open quantum systems in the semiclassical regime poses a grand challenge for computational physics, as the highly oscillatory nature of the dynamics imposes prohibitive resolution requirements on traditional grid-based methods. To overcome this barrier, this paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation. The proposed algorithm exhibits two transformative advantages. First, for the computation of physical observables, its sampling error is independent of the semiclassical parameter $\varepsilon$, thus fundamentally breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit. Second, its mesh-free nature entirely eliminates the boundary-induced instabilities that constrain long-time grid-based simulations. Leveraging these capabilities, the FGS algorithm serves as a powerful investigatory tool for exploring the long-time behavior of open quantum systems. Specifically, we provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking.Open AccessFrozen Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime
Simulating Markovian open quantum systems in the semiclassical regime poses a grand challenge for computational physics, as the highly oscillatory nature of the dynamics imposes prohibitive resolution requirements on traditional grid-based methods. To overcome this barrier, this paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation. The proposed algorithm exhibits two transformative advantages. First, for the computation of physical observables, its sampling error is independent of the semiclassical parameter $\varepsilon$, thus fundamentally breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit. Second, its mesh-free nature entirely eliminates the boundary-induced instabilities that constrain long-time grid-based simulations. Leveraging these capabilities, the FGS algorithm serves as a powerful investigatory tool for exploring the long-time behavior of open quantum systems. Specifically, we provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking. - Open Access
- 28 November 2025
- Published by Global Science Press in Communications in Computational Physics
- Vol. 39 (2) , 578-614
Uncertainty Quantification of Phase Transition Problems with an Injection Boundary
We develop an enthalpy-based modeling and computational framework to quantify uncertainty in Stefan problems with an injection boundary. Inspired by airfoil icing studies, we consider a system featuring an injection boundary inducing domain changes and a free boundary separating phases, resulting in two types of moving boundaries. Our proposed enthalpy-based formulation seamlessly integrates thermal diffusion across the domain with energy fluxes at the boundaries, addressing a modified injection condition for boundary movement. Uncertainty then stems from random variations in the injection boundary. The primary focus of our Uncertainty Quantification (UQ) centers on investigating the effects of uncertainty on free boundary propagation. Through mapping to a reference domain, we derive an enthalpy-based numerical scheme tailored to the transformed coordinate system, facilitating a simple and efficient simulation. Numerical and UQ studies in one and two dimensions validate the proposed model and the extended enthalpy method. They offer intriguing insights into ice accretion and other multiphysics processes involving phase transitions.
- 28 November 2025
- Published by Global Science Press in Communications in Computational Physics
- Vol. 39 (2) , 578-614
Open AccessUncertainty Quantification of Phase Transition Problems with an Injection Boundary
We develop an enthalpy-based modeling and computational framework to quantify uncertainty in Stefan problems with an injection boundary. Inspired by airfoil icing studies, we consider a system featuring an injection boundary inducing domain changes and a free boundary separating phases, resulting in two types of moving boundaries. Our proposed enthalpy-based formulation seamlessly integrates thermal diffusion across the domain with energy fluxes at the boundaries, addressing a modified injection condition for boundary movement. Uncertainty then stems from random variations in the injection boundary. The primary focus of our Uncertainty Quantification (UQ) centers on investigating the effects of uncertainty on free boundary propagation. Through mapping to a reference domain, we derive an enthalpy-based numerical scheme tailored to the transformed coordinate system, facilitating a simple and efficient simulation. Numerical and UQ studies in one and two dimensions validate the proposed model and the extended enthalpy method. They offer intriguing insights into ice accretion and other multiphysics processes involving phase transitions.