Xuyan Xiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xuyan Xiang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Yingchun Deng
College of Mathematics and Statistics, Hunan Normal University 2 , Changsha 410081, China
6 shared publications- Jieming Zhou
MOE-LCSM, School of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
4 shared publications Xiangqun Yang
College of Mathematics and Statistics, Hunan Normal University 2 , Changsha 410081, China
3 shared publications- Xiaoyun Mo
College of Mathematics and Statistics, Hunan University of Finance and Economics, Changsha 410205, China
2 shared publications - Yiming Ding
Wuhan University of Science and Technology School of Mathematics and Systems Science Wuhan 430065, Hubei
2 shared publications Beilin Xiang
College of Mathematics and Statistics, Hunan Normal University, Changsha 410081 2
1 shared publication
Latest Publications
- 1 November 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (11)
Recovering nonlinear dynamics from first-passage events: A Markov process inversion approach with application to gene expression variability
Stochastic nonlinear systems, from gene circuits to financial markets, are ubiquitous. A key challenge is inferring their governing parameters from sparse event times rather than continuous trajectories. We introduce a Markov process inversion approach (MPIA) that recovers drift and diffusion coefficients of nonlinear diffusions solely from first-passage times to a fixed boundary. Using arithmetic and geometric Brownian motions—representing constant-coefficient and state-dependent (log-linear) diffusions, respectively—the latter a paradigmatic model of multiplicative noise capturing state-dependent fluctuations—we develop a two-step procedure: fitting the inverse Gaussian distribution to hitting times, then analytically recovering generator parameters. We provide a comprehensive analysis of distribution fitting strategies, including maximum likelihood, Bayesian, and robust methods, and establish their relative merits. Asymptotic normality and consistency are proven, and the method is validated through high-precision simulations involving both direct sampling and full-path simulation. Applied to a synthetic gene circuit, MPIA disentangles effective growth rate from noise strength using only threshold-crossing times—readily accessible in high-throughput microfluidic experiments but invisible to trajectory-based methods. This event-based framework directly addresses the data constraints of modern single-cell technologies, where photobleaching and storage limitations make continuous fluorescence tracking impractical for large populations. Practical guidelines for handling censored data, drift direction verification, and model diagnostics are provided. This work lays a foundational blueprint for inversion strategies tailored to diffusions with analytically tractable first-passage-time distributions—specifically, constant-coefficient, log-linear, and the broader class of Lamperti-reducible diffusions. Extensions to non-reducible models, such as Ornstein–Uhlenbeck, Cox–Ingersoll–Ross, and logistic diffusions, via spectral and moment-based techniques, are discussed as future directions.
- 1 November 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (11)
Recovering nonlinear dynamics from first-passage events: A Markov process inversion approach with application to gene expression variability
Stochastic nonlinear systems, from gene circuits to financial markets, are ubiquitous. A key challenge is inferring their governing parameters from sparse event times rather than continuous trajectories. We introduce a Markov process inversion approach (MPIA) that recovers drift and diffusion coefficients of nonlinear diffusions solely from first-passage times to a fixed boundary. Using arithmetic and geometric Brownian motions—representing constant-coefficient and state-dependent (log-linear) diffusions, respectively—the latter a paradigmatic model of multiplicative noise capturing state-dependent fluctuations—we develop a two-step procedure: fitting the inverse Gaussian distribution to hitting times, then analytically recovering generator parameters. We provide a comprehensive analysis of distribution fitting strategies, including maximum likelihood, Bayesian, and robust methods, and establish their relative merits. Asymptotic normality and consistency are proven, and the method is validated through high-precision simulations involving both direct sampling and full-path simulation. Applied to a synthetic gene circuit, MPIA disentangles effective growth rate from noise strength using only threshold-crossing times—readily accessible in high-throughput microfluidic experiments but invisible to trajectory-based methods. This event-based framework directly addresses the data constraints of modern single-cell technologies, where photobleaching and storage limitations make continuous fluorescence tracking impractical for large populations. Practical guidelines for handling censored data, drift direction verification, and model diagnostics are provided. This work lays a foundational blueprint for inversion strategies tailored to diffusions with analytically tractable first-passage-time distributions—specifically, constant-coefficient, log-linear, and the broader class of Lamperti-reducible diffusions. Extensions to non-reducible models, such as Ornstein–Uhlenbeck, Cox–Ingersoll–Ross, and logistic diffusions, via spectral and moment-based techniques, are discussed as future directions.
- Open Access
- 17 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (14) , 2586
Moment-Based Identification of Diffusion Generators via First Hitting Times
We propose a method-of-moments (MoM) approach to identify the drift and diffusion parameters of arithmetic and geometric Brownian motion from independent observations of the first hitting times for a fixed boundary. Unlike techniques that assume an inverse Gaussian or any specific distribution for the hitting times, our estimator matches only the first two sample moments to theoretical expressions derived from the backward Kolmogorov equation. This yields closed-form formulas that require no numerical optimization or distribution fitting, a distinct advantage for high-throughput microfluidic experiments where only threshold-crossing events are recorded, often for thousands of cells. We establish identifiability, prove consistency and asymptotic normality, and provide finite-sample bias corrections. Numerical simulations demonstrate accurate inference of the effective production rate and noise strength in a synthetic genetic reporter system with sample sizes as small as 50 cells. The proposed moment-based MoM estimator is computationally instantaneous and exhibits robustness against mild model misspecification, making it a practical tool for event-based parameter inference in single-cell biology.
- 17 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (14) , 2586
Open AccessMoment-Based Identification of Diffusion Generators via First Hitting Times
We propose a method-of-moments (MoM) approach to identify the drift and diffusion parameters of arithmetic and geometric Brownian motion from independent observations of the first hitting times for a fixed boundary. Unlike techniques that assume an inverse Gaussian or any specific distribution for the hitting times, our estimator matches only the first two sample moments to theoretical expressions derived from the backward Kolmogorov equation. This yields closed-form formulas that require no numerical optimization or distribution fitting, a distinct advantage for high-throughput microfluidic experiments where only threshold-crossing events are recorded, often for thousands of cells. We establish identifiability, prove consistency and asymptotic normality, and provide finite-sample bias corrections. Numerical simulations demonstrate accurate inference of the effective production rate and noise strength in a synthetic genetic reporter system with sample sizes as small as 50 cells. The proposed moment-based MoM estimator is computationally instantaneous and exhibits robustness against mild model misspecification, making it a practical tool for event-based parameter inference in single-cell biology.
- Open Access
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Identifying the generator matrix of a stationary Markov chain using partially observable data
Given that most states in real-world systems are inaccessible, it is critical to study the inverse problem of an irreversibly stationary Markov chain regarding how a generator matrix can be identified using minimal observations. The hitting-time distribution of an irreversibly stationary Markov chain is first generalized from a reversible case. The hitting-time distribution is then decoded via the taboo rate, and the results show remarkably that under mild conditions, the generator matrix of a reversible Markov chain or a specific case of irreversibly stationary ones can be identified by utilizing observations from all leaves and two adjacent states in each cycle. Several algorithms are proposed for calculating the generator matrix accurately, and numerical examples are presented to confirm their validity and efficiency. An application to neurophysiology is provided to demonstrate the applicability of such statistics to real-world data. This means that partially observable data can be used to identify the generator matrix of a stationary Markov chain.
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Open AccessIdentifying the generator matrix of a stationary Markov chain using partially observable data
Given that most states in real-world systems are inaccessible, it is critical to study the inverse problem of an irreversibly stationary Markov chain regarding how a generator matrix can be identified using minimal observations. The hitting-time distribution of an irreversibly stationary Markov chain is first generalized from a reversible case. The hitting-time distribution is then decoded via the taboo rate, and the results show remarkably that under mild conditions, the generator matrix of a reversible Markov chain or a specific case of irreversibly stationary ones can be identified by utilizing observations from all leaves and two adjacent states in each cycle. Several algorithms are proposed for calculating the generator matrix accurately, and numerical examples are presented to confirm their validity and efficiency. An application to neurophysiology is provided to demonstrate the applicability of such statistics to real-world data. This means that partially observable data can be used to identify the generator matrix of a stationary Markov chain.
- 6 November 2023
- Published by Springer Nature in Acta Mathematica Scientia
- Vol. 43 (6) , 2629-2648
An informatic approach to a long memory stationary process
- 6 November 2023
- Published by Springer Nature in Acta Mathematica Scientia
- Vol. 43 (6) , 2629-2648
An informatic approach to a long memory stationary process
- Open Access
- 25 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2448
An Excess Entropy Approach to Classify Long-Term and Short-Term Memory Stationary Time Series
Long-term memory behavior is one of the most important phenomena that has appeared in the time series analysis. Different from most definitions of second-order properties, an excess entropy approach is developed for stationary time series to classify long-term and short-term memory. A stationary sequence with finite block entropy is long-term memory if its excess entropy is infinite. The simulation results are graphically demonstrated after some theoretical results are simply presented by various stochastic sequences. Such an approach has advantages over the traditional ways that the excess entropy of stationary sequence with finite block entropy is invariant under instantaneous one-to-one transformation, and that it only requires very weak moment conditions rather than second-order moment conditions and thus can be applied to distinguish the LTM behavior of stationary sequences with unbounded second moment (e.g., heavy tail distribution). Finally, several applications on real data are exhibited.
- 25 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2448
Open AccessAn Excess Entropy Approach to Classify Long-Term and Short-Term Memory Stationary Time Series
Long-term memory behavior is one of the most important phenomena that has appeared in the time series analysis. Different from most definitions of second-order properties, an excess entropy approach is developed for stationary time series to classify long-term and short-term memory. A stationary sequence with finite block entropy is long-term memory if its excess entropy is infinite. The simulation results are graphically demonstrated after some theoretical results are simply presented by various stochastic sequences. Such an approach has advantages over the traditional ways that the excess entropy of stationary sequence with finite block entropy is invariant under instantaneous one-to-one transformation, and that it only requires very weak moment conditions rather than second-order moment conditions and thus can be applied to distinguish the LTM behavior of stationary sequences with unbounded second moment (e.g., heavy tail distribution). Finally, several applications on real data are exhibited.
- 13 March 2020
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 51 (1) , 345-360
n-Dimensional Laplace Transforms of Occupation Times for Pre-Exit Diffusion Processes
- 13 March 2020
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 51 (1) , 345-360
n-Dimensional Laplace Transforms of Occupation Times for Pre-Exit Diffusion Processes
- 18 March 2019
- Published by Taylor & Francis in Optimization
- Vol. 68 (9) , 1625-1652
Optimal investment and risk control policies for an insurer in an incomplete market
In this paper, we apply the martingale approach to investigate the optimal investment and risk control problem for an insurer in an incomplete market. The claim risk of per policy is characterized by a compound Poisson process with drift, and the insurer can be invested in multiple risky assets whose price processes are described by the geometric Brownian motions model. By ‘complete’ the incomplete market, closed-form solutions to the problems of mean–variance criterion and expected exponential utility maximization are obtained. Moreover, numerical simulations are presented to illustrate the results with the basic parameters.
- 18 March 2019
- Published by Taylor & Francis in Optimization
- Vol. 68 (9) , 1625-1652
Optimal investment and risk control policies for an insurer in an incomplete market
In this paper, we apply the martingale approach to investigate the optimal investment and risk control problem for an insurer in an incomplete market. The claim risk of per policy is characterized by a compound Poisson process with drift, and the insurer can be invested in multiple risky assets whose price processes are described by the geometric Brownian motions model. By ‘complete’ the incomplete market, closed-form solutions to the problems of mean–variance criterion and expected exponential utility maximization are obtained. Moreover, numerical simulations are presented to illustrate the results with the basic parameters.
- Open Access
- 28 March 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-13
Statistical Identification of Markov Chain on Trees
The theoretical study of continuous-time homogeneous Markov chains is usually based on a natural assumption of a known transition rate matrix (TRM). However, the TRM of a Markov chain in realistic systems might be unknown and might even need to be identified by partially observable data. Thus, an issue on how to identify the TRM of the underlying Markov chain by partially observable information is derived from the great significance in applications. That is what we call the statistical identification of Markov chain. The Markov chain inversion approach has been derived for basic Markov chains by partial observation at few states. In the current letter, a more extensive class of Markov chain on trees is investigated. Firstly, a type of a more operable derivative constraint is developed. Then, it is shown that all Markov chains on trees can be identified only by such derivative constraints of univariate distributions of sojourn time and/or hitting time at a few states. A numerical example is included to demonstrate the correctness of the proposed algorithms.
- 28 March 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-13
Open AccessStatistical Identification of Markov Chain on Trees
The theoretical study of continuous-time homogeneous Markov chains is usually based on a natural assumption of a known transition rate matrix (TRM). However, the TRM of a Markov chain in realistic systems might be unknown and might even need to be identified by partially observable data. Thus, an issue on how to identify the TRM of the underlying Markov chain by partially observable information is derived from the great significance in applications. That is what we call the statistical identification of Markov chain. The Markov chain inversion approach has been derived for basic Markov chains by partial observation at few states. In the current letter, a more extensive class of Markov chain on trees is investigated. Firstly, a type of a more operable derivative constraint is developed. Then, it is shown that all Markov chains on trees can be identified only by such derivative constraints of univariate distributions of sojourn time and/or hitting time at a few states. A numerical example is included to demonstrate the correctness of the proposed algorithms.
- 1 January 2018
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 34 (1) , 1-10
Adjoining batch Markov arrival processes of a Markov chain
- 1 January 2018
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 34 (1) , 1-10
Adjoining batch Markov arrival processes of a Markov chain
- Open Access
An entropic characterization of long memory stationary process
Long memory or long range dependency is an important phenomenon that may arise in the analysis of time series or spatial data. Most of the definitions of long memory of a stationary process $X=\{X_1, X_2,\cdots,\}$ are based on the second-order properties of the process. The excess entropy of a stationary process is the summation of redundancies which relates to the rate of convergence of the conditional entropy $H(X_n|X_{n-1},\cdots, X_1)$ to the entropy rate. It is proved that the excess entropy is identical to the mutual information between the past and the future when the entropy $H(X_1)$ is finite. We suggest the definition that a stationary process is long memory if the excess entropy is infinite. Since the definition of excess entropy of a stationary process requires very weak moment condition on the distribution of the process, it can be applied to processes whose distributions without bounded second moment. A significant property of excess entropy is that it is invariant under invertible transformation, which enables us to know the excess entropy of a stationary process from the excess entropy of other process. For stationary Guassian process, the excess entropy characterization of long memory relates to popular characterization well. It is proved that the excess entropy of fractional Gaussian noise is infinite if the Hurst parameter $H \in (1/2, 1)$.Open AccessAn entropic characterization of long memory stationary process
Long memory or long range dependency is an important phenomenon that may arise in the analysis of time series or spatial data. Most of the definitions of long memory of a stationary process $X=\{X_1, X_2,\cdots,\}$ are based on the second-order properties of the process. The excess entropy of a stationary process is the summation of redundancies which relates to the rate of convergence of the conditional entropy $H(X_n|X_{n-1},\cdots, X_1)$ to the entropy rate. It is proved that the excess entropy is identical to the mutual information between the past and the future when the entropy $H(X_1)$ is finite. We suggest the definition that a stationary process is long memory if the excess entropy is infinite. Since the definition of excess entropy of a stationary process requires very weak moment condition on the distribution of the process, it can be applied to processes whose distributions without bounded second moment. A significant property of excess entropy is that it is invariant under invertible transformation, which enables us to know the excess entropy of a stationary process from the excess entropy of other process. For stationary Guassian process, the excess entropy characterization of long memory relates to popular characterization well. It is proved that the excess entropy of fractional Gaussian noise is infinite if the Hurst parameter $H \in (1/2, 1)$.