Pingping Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pingping Zeng has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Gongqiu Zhang
School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China
4 shared publications - Weinan Zhang
Harbin Inst Technol, Sch Math, Harbin, Peoples R China
3 shared publications Yue Kuen Kwok
Financial Technology Thrust, Hong Kong University of Science and Technology, Guangzhou, China
3 shared publications- Chao Shi
Shanghai Univ Finance & Econ, Sch Informat Management & Engn, Shanghai, Peoples R China
1 shared publication - Lingfei Li
Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong SAR
1 shared publication - Pingping Jiang
Center for Financial Engineering Soochow University Suzhou China
1 shared publication
Latest Publications
- 24 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 333 (3) , 956-968
Drawdowns, drawups, and occupation times under general Markov models
- 24 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 333 (3) , 956-968
Drawdowns, drawups, and occupation times under general Markov models
- Open Access
Drawdowns, Drawups, and Occupation Times under General Markov Models
Drawdown risk, an important metric in financial risk management, poses significant computational challenges due to its highly path-dependent nature. This paper proposes a unified framework for computing five important drawdown quantities introduced in Landriault et al. (2015) and Zhang (2015) under general Markov models. We first establish linear systems and develop efficient algorithms for such problems under continuous-time Markov chains (CTMCs), and then establish their theoretical convergence to target quantities under general Markov models. Notably, the proposed algorithms for most quantities achieve the same complexity order as those for path-independent problems: cubic in the number of CTMC states for general Markov models and linear when applied to diffusion models. Rigorous convergence analysis is conducted under weak regularity conditions, and extensive numerical experiments validate the accuracy and efficiency of the proposed algorithms.
Open AccessDrawdowns, Drawups, and Occupation Times under General Markov Models
Drawdown risk, an important metric in financial risk management, poses significant computational challenges due to its highly path-dependent nature. This paper proposes a unified framework for computing five important drawdown quantities introduced in Landriault et al. (2015) and Zhang (2015) under general Markov models. We first establish linear systems and develop efficient algorithms for such problems under continuous-time Markov chains (CTMCs), and then establish their theoretical convergence to target quantities under general Markov models. Notably, the proposed algorithms for most quantities achieve the same complexity order as those for path-independent problems: cubic in the number of CTMC states for general Markov models and linear when applied to diffusion models. Rigorous convergence analysis is conducted under weak regularity conditions, and extensive numerical experiments validate the accuracy and efficiency of the proposed algorithms.
- 1 July 2024
- Published by Taylor & Francis in North American Actuarial Journal
- Vol. 29 (1) , 11-43
Credibility Theory for Variance Premium Principle
- 1 July 2024
- Published by Taylor & Francis in North American Actuarial Journal
- Vol. 29 (1) , 11-43
Credibility Theory for Variance Premium Principle
- 2 April 2024
- Published by Taylor & Francis in Quantitative Finance
- Vol. 24 (3-4) , 367-386
Speed and duration of drawdown under general Markov models
- 2 April 2024
- Published by Taylor & Francis in Quantitative Finance
- Vol. 24 (3-4) , 367-386
Speed and duration of drawdown under general Markov models
- 17 January 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 98 (2) , 1-35
Pricing Discretely Monitored Asian Options Under Regime-Switching and Stochastic Volatility Models with Jumps
- 17 January 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 98 (2) , 1-35
Pricing Discretely Monitored Asian Options Under Regime-Switching and Stochastic Volatility Models with Jumps
- 14 November 2023
- Published by Elsevier in Operations Research Letters
- Vol. 51 (6) , 687-694
Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps
- 14 November 2023
- Published by Elsevier in Operations Research Letters
- Vol. 51 (6) , 687-694
Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps
- 26 September 2023
- Published by Taylor & Francis in Quantitative Finance
- Vol. 23 (11) , 1677-1697
A transform-based method for pricing Asian options under general two-dimensional models
- 26 September 2023
- Published by Taylor & Francis in Quantitative Finance
- Vol. 23 (11) , 1677-1697
A transform-based method for pricing Asian options under general two-dimensional models
- 5 April 2023
- Published by Wiley in Mathematical Finance
- Vol. 33 (3) , 842-890
Analytical solvability and exact simulation in models with affine stochastic volatility and Lévy jumps
- 5 April 2023
- Published by Wiley in Mathematical Finance
- Vol. 33 (3) , 842-890
Analytical solvability and exact simulation in models with affine stochastic volatility and Lévy jumps
- 4 November 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (6) , 726-731
Computable error bounds of multidimensional Euler inversion and their financial applications
- 4 November 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (6) , 726-731
Computable error bounds of multidimensional Euler inversion and their financial applications
- Open Access
- 12 October 2022
- Published by Elsevier in SSRN Electronic Journal
Analytical Solvability and Exact Simulation in Models with Affine Stochastic Volatility and Levy Jumps
In this paper, we investigate the analytical solvability of models with affine stochastic volatility and Levy jumps by deriving a unified formula for the conditional moment generating function of the log-asset price and showing the condition under which this new formula is explicit. The results lay a foundation for a range of valuation, calibration, and econometric problems. We then combine our theoretical results, the Hilbert transform method, various interpolation techniques, with the dimension reduction technique to propose unified simulation schemes for solvable models with affine stochastic volatility and Levy jumps. In contrast to traditional exact simulation methods, our approach is applicable to a broad class of models, maintains good accuracy, and enables efficient pricing of discretely monitored path-dependent derivatives. We analyze various sources of errors arising from the simulation approach and present error bounds. Finally, extensive numerical results demonstrate that our method is highly accurate, efficient, simple to implement, and widely applicable.
- 12 October 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessAnalytical Solvability and Exact Simulation in Models with Affine Stochastic Volatility and Levy Jumps
In this paper, we investigate the analytical solvability of models with affine stochastic volatility and Levy jumps by deriving a unified formula for the conditional moment generating function of the log-asset price and showing the condition under which this new formula is explicit. The results lay a foundation for a range of valuation, calibration, and econometric problems. We then combine our theoretical results, the Hilbert transform method, various interpolation techniques, with the dimension reduction technique to propose unified simulation schemes for solvable models with affine stochastic volatility and Levy jumps. In contrast to traditional exact simulation methods, our approach is applicable to a broad class of models, maintains good accuracy, and enables efficient pricing of discretely monitored path-dependent derivatives. We analyze various sources of errors arising from the simulation approach and present error bounds. Finally, extensive numerical results demonstrate that our method is highly accurate, efficient, simple to implement, and widely applicable.