Qiang Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qiang Yao has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Jie Sun
National University of Singapore, Singapore, Singapore
6 shared publications Sai Song
Key Laboratory of Advanced Theory and Application in Statistics and Data Science MOE, School of Statistics, East China Normal University, Shanghai 200062, China
3 shared publications- Erjia Cui
Zhejiang Univ, Sch Math Sci, Hangzhou 310027, Zhejiang, Peoples R China
2 shared publications - Marcus Ang
Lee Kong Chian School of Business, Singapore Management University, Singapore 178899, Singapore
2 shared publications - Min Zhang
School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
2 shared publications - Minzhi Zhao
School of Mathematical Sciences Zhejiang University 310027 Hangzhou China
2 shared publications
Latest Publications
- Open Access
Limit Properties of Record Numbers in Random walks
In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $σ$--record numbers using similar methods. Additionally, we identify a sufficient condition for the existence of functional limits for record numbers in continuous-time random walks. Finally, we derive corresponding results for large deviations, moderate deviations, and laws of the iterated logarithm pertaining to record numbers in discrete-time random walks.
Open AccessLimit Properties of Record Numbers in Random walks
In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $σ$--record numbers using similar methods. Additionally, we identify a sufficient condition for the existence of functional limits for record numbers in continuous-time random walks. Finally, we derive corresponding results for large deviations, moderate deviations, and laws of the iterated logarithm pertaining to record numbers in discrete-time random walks.
- 1 September 2022
- Published by Global Science Press in Journal of Mathematical Study
- Vol. 55 (3) , 254-270
A New Method for Computing the Expected Hitting Time Between Arbitrary Different Configurations of the Multiple–Urn Ehrenfest Model
We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the $n$ urns by Urn $1$ to Urn $n$, where $n\geq2$. Initially, $M$ balls are randomly placed in the $n$ urns. At each subsequent step, a ball is selected and put into the other $n-1$ urns with equal probability. The expected hitting time leading to a change of the $M$ balls' status is computed using the method of stopping times. As a corollary, we obtain the expected hitting time of moving all the $M$ balls from Urn $1$ to Urn $2$.- 1 September 2022
- Published by Global Science Press in Journal of Mathematical Study
- Vol. 55 (3) , 254-270
A New Method for Computing the Expected Hitting Time Between Arbitrary Different Configurations of the Multiple–Urn Ehrenfest Model
We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the $n$ urns by Urn $1$ to Urn $n$, where $n\geq2$. Initially, $M$ balls are randomly placed in the $n$ urns. At each subsequent step, a ball is selected and put into the other $n-1$ urns with equal probability. The expected hitting time leading to a change of the $M$ balls' status is computed using the method of stopping times. As a corollary, we obtain the expected hitting time of moving all the $M$ balls from Urn $1$ to Urn $2$.- Open Access
The Construction of Two Kinds of Bijections in Simple Random Walk Paths
It is known that for the 2n-step symmetric simple random walk on Z, two events have the same probability if and only if their sets of paths have the same cardinality. In this article, we construct two kinds of bijections between sets of paths with the same cardinality. The construction is natural and simple. It can be easily realized through programming. More importantly, this construction opens a door to prove that two events in the 2n-step symmetric simple random walk on Z have the same probability and some further related results.
Open AccessThe Construction of Two Kinds of Bijections in Simple Random Walk Paths
It is known that for the 2n-step symmetric simple random walk on Z, two events have the same probability if and only if their sets of paths have the same cardinality. In this article, we construct two kinds of bijections between sets of paths with the same cardinality. The construction is natural and simple. It can be easily realized through programming. More importantly, this construction opens a door to prove that two events in the 2n-step symmetric simple random walk on Z have the same probability and some further related results.
- Open Access
A new method for computing the expected hitting time between arbitrary different configurations of the multiple-urn Ehrenfest model
We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the other n-1 urns with equal probability. The expected hitting time leading to a change of the M balls' status is computed using the method of stopping times. As a corollary, we obtain the expected hitting time of moving all the M balls from Urn 1 to Urn 2. This proves a conjecture which was recently made in Chen et al.(2017).
Open AccessA new method for computing the expected hitting time between arbitrary different configurations of the multiple-urn Ehrenfest model
We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the other n-1 urns with equal probability. The expected hitting time leading to a change of the M balls' status is computed using the method of stopping times. As a corollary, we obtain the expected hitting time of moving all the M balls from Urn 1 to Urn 2. This proves a conjecture which was recently made in Chen et al.(2017).
- Open Access
Risk Minimization, Regret Minimization and Progressive Hedging Algorithms
This paper begins with a study on the dual representations of risk and regret measures and their impact on modeling multistage decision making under uncertainty. A relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory. Such a relationship opens a door to a decomposition scheme, called progressive hedging, for solving multistage risk minimization and regret minimization problems. In particular, the classical progressive hedging algorithm is modified in order to handle a new class of linkage constraints that arises from reformulations and other applications of risk and regret minimization problems. Numerical results are provided to show the efficiency of the progressive hedging algorithms.
Open AccessRisk Minimization, Regret Minimization and Progressive Hedging Algorithms
This paper begins with a study on the dual representations of risk and regret measures and their impact on modeling multistage decision making under uncertainty. A relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory. Such a relationship opens a door to a decomposition scheme, called progressive hedging, for solving multistage risk minimization and regret minimization problems. In particular, the classical progressive hedging algorithm is modified in order to handle a new class of linkage constraints that arises from reformulations and other applications of risk and regret minimization problems. Numerical results are provided to show the efficiency of the progressive hedging algorithms.
- 11 February 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 181 (2) , 509-530
Risk minimization, regret minimization and progressive hedging algorithms
- 11 February 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 181 (2) , 509-530
Risk minimization, regret minimization and progressive hedging algorithms
- 1 February 2020
- Published by Elsevier in Statistics & Probability Letters
- Vol. 157
On the distribution of the hitting time for the –urn Ehrenfest model- 1 February 2020
- Published by Elsevier in Statistics & Probability Letters
- Vol. 157
On the distribution of the hitting time for the –urn Ehrenfest model- Open Access
Phase Transition for the Contact Process in a Random Environment on Zd*Z+
We review the results in Chen & Yao(2009,2012) which concern the contact process in a static random environment on the half space Z^d*Z^+ and make some addition to them. Furthermore, we explain why our methods cannot apply to the whole space case and compare our results with some related works.
Open AccessPhase Transition for the Contact Process in a Random Environment on Zd*Z+
We review the results in Chen & Yao(2009,2012) which concern the contact process in a static random environment on the half space Z^d*Z^+ and make some addition to them. Furthermore, we explain why our methods cannot apply to the whole space case and compare our results with some related works.
- Open Access
On the distribution of the hitting time for the N-urn Ehrenfest model
In this paper, we consider the N-urn Ehrenfest model. By utilizing an auxiliary continuous-time Markov chain, we obtain the explicit formula for the Laplace transform of the hitting time from a single state to a set A of states where A satisfies some symmetric properties. After obtaining the Laplace transform, we are able to compute the high-order moments(especially, variance) for the hitting time.
Open AccessOn the distribution of the hitting time for the N-urn Ehrenfest model
In this paper, we consider the N-urn Ehrenfest model. By utilizing an auxiliary continuous-time Markov chain, we obtain the explicit formula for the Laplace transform of the hitting time from a single state to a set A of states where A satisfies some symmetric properties. After obtaining the Laplace transform, we are able to compute the high-order moments(especially, variance) for the hitting time.
- 7 November 2017
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 46 (1) , 87-94
On Coherency and Other Properties of MAXVAR
- 7 November 2017
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 46 (1) , 87-94
On Coherency and Other Properties of MAXVAR