Loading [MathJax]/jax/output/SVG/jax.js
Editorial Special Issues

Biochemical Problems, Mathematical Solutions

  • Received: 15 November 2021 Revised: 15 November 2021 Accepted: 31 December 2021 Published: 10 January 2022
  • Citation: Marc R. Roussel, Moisés Santillán. Biochemical Problems, Mathematical Solutions[J]. AIMS Mathematics, 2022, 7(4): 5662-5669. doi: 10.3934/math.2022313

    Related Papers:

    [1] Ibtisam Aldawish, Mohamed Jleli, Bessem Samet . Blow-up of solutions to fractional differential inequalities involving ψ-Caputo fractional derivatives of different orders. AIMS Mathematics, 2022, 7(5): 9189-9205. doi: 10.3934/math.2022509
    [2] Tao Yan, Ghulam Farid, Sidra Bibi, Kamsing Nonlaopon . On Caputo fractional derivative inequalities by using strongly (α,hm)-convexity. AIMS Mathematics, 2022, 7(6): 10165-10179. doi: 10.3934/math.2022565
    [3] Muhammad Tariq, Asif Ali Shaikh, Sotiris K. Ntouyas, Jessada Tariboon . Some novel refinements of Hermite-Hadamard and Pachpatte type integral inequalities involving a generalized preinvex function pertaining to Caputo-Fabrizio fractional integral operator. AIMS Mathematics, 2023, 8(11): 25572-25610. doi: 10.3934/math.20231306
    [4] Hadjer Belbali, Maamar Benbachir, Sina Etemad, Choonkil Park, Shahram Rezapour . Existence theory and generalized Mittag-Leffler stability for a nonlinear Caputo-Hadamard FIVP via the Lyapunov method. AIMS Mathematics, 2022, 7(8): 14419-14433. doi: 10.3934/math.2022794
    [5] Choukri Derbazi, Hadda Hammouche . Caputo-Hadamard fractional differential equations with nonlocal fractional integro-differential boundary conditions via topological degree theory. AIMS Mathematics, 2020, 5(3): 2694-2709. doi: 10.3934/math.2020174
    [6] Deepak B. Pachpatte . On some ψ Caputo fractional Čebyšev like inequalities for functions of two and three variables. AIMS Mathematics, 2020, 5(3): 2244-2260. doi: 10.3934/math.2020148
    [7] M. A. Zaky, M. Babatin, M. Hammad, A. Akgül, A. S. Hendy . Efficient spectral collocation method for nonlinear systems of fractional pantograph delay differential equations. AIMS Mathematics, 2024, 9(6): 15246-15262. doi: 10.3934/math.2024740
    [8] M. J. Huntul . Inverse source problems for multi-parameter space-time fractional differential equations with bi-fractional Laplacian operators. AIMS Mathematics, 2024, 9(11): 32734-32756. doi: 10.3934/math.20241566
    [9] Imran Abbas Baloch, Thabet Abdeljawad, Sidra Bibi, Aiman Mukheimer, Ghulam Farid, Absar Ul Haq . Some new Caputo fractional derivative inequalities for exponentially (θ,hm)–convex functions. AIMS Mathematics, 2022, 7(2): 3006-3026. doi: 10.3934/math.2022166
    [10] Muhammad Tariq, Hijaz Ahmad, Abdul Ghafoor Shaikh, Soubhagya Kumar Sahoo, Khaled Mohamed Khedher, Tuan Nguyen Gia . New fractional integral inequalities for preinvex functions involving Caputo-Fabrizio operator. AIMS Mathematics, 2022, 7(3): 3440-3455. doi: 10.3934/math.2022191


  • Order statistic (OS) plays an important role in nonparametric statistics. Under the assumption of large sample size, relative investigations are mainly focused on asymptotic distributions of some functions of these OSs. Among these studies, the elegant one provided by Bahadur in 1966 (see [1]) is the central limit theorem on OSs. As was revealed there, under the situation of an absolute continuous population, the sequence of some normalized OSs usually has an asymptotic standard normal distribution. That is useful in the construction of a confidence interval for estimating some certain quantile of the population. Comparatively, study on some moment convergence of the mentioned sequence is also significant, for instance, if we utilize a sample quantile as an asymptotic unbiased estimator for the corresponding quantile of the population, then the analysis of the second moment convergence of the sequence is significant if we want to make an approximation of the mean square error of the estimate.

    However, the analysis of moment convergence of OSs is usually very difficult, the reason, as was interpreted by Thomas and Sreekumar in [2], may lie in the fact that the moment of OS is usually very difficult to obtain.

    For a random sequence, although it is well-known that the convergence in distribution does not necessarily guarantee the corresponding moment convergence, usually, that obstacle can be sufficiently overcome by the additional requirement of the uniform integrability of the sequence. For instance, we can see [3] as a reference dealing with some extreme OSs under some populations. In that article Wang et al. discussed uniform integrability of the sequence of some normalized extreme OSs and derived equivalent moment expressions there.

    Here in the following theorem we discuss the moment convergence for some common OSs rather than extreme ones.

    Theorem 1. For a population X distributed according to a continuous probability density function (pdf) f(x), let p(0,1) and xp be the pquantile of X satisfying f(xp)>0. Let (X1,...,Xn) be a random sample arising from X and Xi:n be the ith OS. If the cumulative distribution function (cdf) F(x) of X has an inverse function G(x) satisfying

    |G(x)|Bxq(1x)q (1.1)

    for some constants B>0,q0 and all x(0,1), then for arbitrary δ>0, we have

    limnEXδi:n=xδp,

    provided limn+i/n=p or equivalently rewritten as i/n=p+o(1).

    Remark 1. Now we use the symbol z for the integer part of a positive number z and mn,p for the p-quantile of a random sample (X1,,Xn), namely, mn,p=(Xpn:n+Xpn+1:n)/2 if pn is an integer and mn,p=Xpn+1:n otherwise. As both limiting conclusions limnEXδpn:n=xδp and limnEXδpn+1:n=xδp hold under the conditions of Theorem 1 and mδn,p is always squeezed by Xδpn:n and Xδpn+1:n, according to the Sandwich Theorem, we have limnEmδn,p=xδp.

    Remark 2. For a continuous function H(x) where x(0,1), if

    limx0+H(x)=limx1H(x)=0,

    then there is a constant C>0 such that the inequality |H(x)|C holds for all x(0,1). By that reason, the condition (1.1) can be replaced by the statement that there exists some constant V0 such that

    limx0+G(x)xV(1x)V=limx1G(x)xV(1x)V=0.

    Remark 3. As the conclusion is on moment convergence of OSs, one may think that the moment of the population X in Theorem 1 should exist. That is a misunderstanding because the existence of the moment of the population is actually unnecessary. We can verify that by a population according to the well-known Cauchy distribution Xf(x)=1π(1+x2) where x(,+), in this case, the moment EX of the population does not exist whereas the required conditions in Theorem 1 are satisfied. Even for some population without any moment of positive order, the conclusion of Theorem 1 still holds, for instance, if f(x)=1x(ln(x))2I[e,)(x) (where the symbol IA(x) or IA stands for the indicator function of a set A), then we have the conclusion

    G(x)=e1x1I(0,1)(x),

    which leads to

    limx0+G(x)x(1x)=limx1G(x)x(1x)=0,

    and therefore the condition (1.1) holds, thus we can see that Theorem 1 is workable. That denies the statement in the final part of paper [4] exclaiming that under the situation Xf(x)=1x(ln(x))2I[e,)(x) any OS does not have any moment of positive order.

    According to Theorem 1, we known that the OS Xi:n of interest is an asymptotic unbiased estimator of the corresponding population quantile xp. Now we explore the infinitesimal type of the mean error of the estimate and derive

    Theorem 2. Let (X1,...,Xn) be a random sample from X who possesses a continuous pdf f(x). Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0 and Xi:n be the ith OS. If the cdf F(x) of X has an inverse function G(x) with a continuous derivative function G(x) in (0,1) and there is a constant U0 such that

    limx0+(G(x)xU(1x)U)=limx1(G(x)xU(1x)U)=0, (1.2)

    then under the assumption i/n=p+O(n1) which indicates the existence of the limit limx0+i/np1/n, the following proposition stands

    |E(Xi:nxp)|=O(1/n). (1.3)

    Remark 4. Obviously we can see that |E(mn,pxp)|=O(1/n) under the conditions of Theorem 2.

    For i.i.d random variables(RVs) X1,...,Xn with an identical expectation μ and a common finite standard deviation σ>0, the famous Levy-Lindeberg central limit theorem reveals that the sequence of normalized sums

    {ni=1Xinμnσ,n1}

    converges in distribution to the standard normal distribution N(0,12) which we denote that as

    ni=1XinμnσDN(0,12).

    In 1964, Bengt presented his work [5] showing that if it is further assumed that E|X1|k<+ for some specific positive k, then the m-th moment convergence conclusion

    E(ni=1Xinμnσ)mEZm,n+, (1.4)

    holds for any positive m satisfying mk. Here and throughout our paper, we denote Z a RV of standard normal distribution N(0,12).

    Let f(x) be a continuous pdf of a population X and xr be the rquantile of X satisfying f(xr)>0. Like the Levy-Lindeberg central limit theorem, Bahadur interpreted in [1] (1966) that for the OS Xi:n, following convergence conclusion holds

    f(xr)(Xi:nxr)r(1r)/nDN(0,12),

    provided i/nr as n.

    Later in 1967, Peter studied moment convergence on similar topic. He obtained in [6] that for some ε>0, r(0,1) and pn=i/n, if the limit condition

    limxxε[1F(x)+F(x)]=0

    holds, then the conclusion

    E(Xi:nxin+1)k=[pn(1pn)/nf(xpn)]kxk2πex2/2dx+o(nk/2)

    is workable for positive integer k and rni(1r)n as n+.

    In addition to the mentioned reference dealing with moment convergence on OSs, we find some more desirable conclusions on similar topic provided by Reiss in reference [7] in 1989, from which we excerpt the one of interest as what follows.

    Theorem 3. Respectively let f(x) and F(x) be the pdf and cdf of a population X. Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0. Assume that on a neighborhood of xp the cdf F(x) has m+1 bounded derivatives. If a positive integer i satisfies i/n=p+O(n1) and E|Xs:j|< holds for some positive integer j and s{1,...,j} and a measurable function h(x) meets the requirement |h(x)||x|k for some positive integer k, then

    Eh(n1/2f(xp)(Xi:nxp)p(1p))=h(x)d(Φ(x)+φ(x)m1i=1ni/2Si,n(x))+O(nm/2). (1.5)

    Here the function φ(x) and Φ(x) are respectively the pdf and cdf of a standard normal distribution while Si,n(x), a polynomial of x with degree not more than 3i1 and coefficients uniformly bounded over n, especially

    S1,n(x)=[2q13p(1p)+p(1p)f(xp)2(f(xp))2]x2+npi+1pp(1p)+2(2p1)3p(1p).

    Remark 5. By putting h(x)=x2 and m=2, we derive under the conditions of Theorem 3 that as n+,

    E(n1/2f(xp)(Xi:nxp)p(1p))2=x2d(Φ(x)+φ(x)n12S1,n(x))+O(n1)1.

    Therefore, we see that the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p))2,nN0}

    is uniformly bounded over nN0. Here N0 is the positive integer number that the moment EX2i:n exists when nN0. In accordance with the inequality |Eξ|Eξ2 if only the moment Eξ2 exists, the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p)),nN0}

    is also uniformly bounded, say, by a number L over n{N0,N0+1,...}. Now that

    |En1/2f(xp)(Xi:nxp)p(1p)|L,nN0,

    we have

    |E(Xi:nxp)|L[p(1p)/f(xp)]n1/2,nN0. (1.6)

    Under the conditions in Theorem 2, when we estimate a population quantile xp by an OS Xi:n, usually the estimate is not likely unbiased, compared with the two conclusions (1.3) and (1.6), the result (1.3) in Theorem 2 is more accurate.

    Remark 6. For a random sample (Y1,Y2,...,Yn) from a uniformly distributed population YU[0,1], we write Yi:n the ith OS. Obviously, conditions in Theorem 3 are fulfilled for any positive integer m2. That yields

    E(n1/2(Yi:np)p(1p))2=x2d(Φ(x)+φ(x)n1/2S1,n(x))+O(n1)=1+O(n1/2),

    and

    E(n1/2(Yi:np)p(1p))6=x6d(Φ(x)+φ(x)5i=1ni/2Si,n(x))+O(n3)=x6φ(x)dx+5i=1αi(n)ni/2+O(n3)=15+5i=1αi(n)ni/2+O(n3),

    where for each i=1,2,...,5, αi(n) is uniformly bounded over n.

    As is above analyzed, we conclude that under the assumption i/n=p+O(n1),

    E(Yi:np)2p(1p)n1andE(Yi:np)615p3(1p)3n3. (1.7)

    Based on Theorems 1 and 3, here we give some alternative conditions to those in Theorem 3 to embody its range of applications including situations even when the population X in Theorem 3 has no definite moment of any positive order. We obtain:

    Theorem 4. Let (X1,...,Xn) be a random sample derived from a population X who has a continuous pdf f(x). Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0 on a neighborhood of xp and the following three conditions hold,

    (i) The cdf F(x) of X has an inverse function G(x) satisfying

    |G(x)|BxQ(1x)Q (1.8)

    for some constants B>0,Q0 and all x(0,1).

    (ii) F(x) has m+1 bounded derivatives where m is a positive integer.

    (iii) Let i/n=p+O(n1) and ai:n=xp+O(n1) as n+.

    Then the following limiting result holds as n+

    E(f(xp)(Xi:nai:n)p(1p)/n)m=EZm+O(n1/2). (1.9)

    Remark 7. For the mean ¯Xn of the random sample (X1,...,Xn) of a population X whose moment EXm exists, according to conclusion (1.4), we see

    E(¯Xnμ)m=(σn)mEZm+o(nm/2),

    which indicates that the mth central moment of sample mean E(¯Xnμ)m is usually of infinitesimal O(nm/2).

    Here under the conditions of Theorem 4, if EXi,n=xp+O(n1) (we will verify in later section that for almost all continuous populations we may encounter, this assertion holds according to Theorem 2), then by Eq (1.9), we are sure that the central moment E(Xi:nEXi:m)m is also of an infinitesimal O(nm/2). Moreover, by putting ai:n=xp, we derive under the assumptions of Theorem 4 that

    E(f(xp)(Xi:nxp)p(1p)/n)m=EZm+O(n1/2).

    Similar to Remark 1, we can also show by Sandwich Theorem that

    E(f(xp)(mn,pxp)p(1p)/n)m=EZm+O(n1/2) (1.10)

    indicating that if we use the sample pquantile mn,p to estimate xp, the corresponding population pquantile, then E(mn,pxp)m=O(nm/2).

    For estimating a parameter of a population without an expectation, estimators based on functions of sample moments are always futile because of uncontrollable fluctuation. Alternatively, estimators obtained by some functions of OSs are usually workable. To find a desirable one of that kind, approximating some moment expressions of OSs is therefore significant. For instance, let a population X be distributed according to a pdf

    f(x,θ1,θ2)=θ2π[θ22+(xθ1)2],<x<+, (1.11)

    where constants θ2>0 and θ1 is unknown. Here x0.56=0.19076θ2+θ1 and x0.56+x0.44=2x0.5=2θ1. To estimate x0.5=θ1, we now compare estimators mn,0.5 and (mn,0.56+mn,0.44)/2. Under large sample size, we deduce according to conclusion (1.10) that

    E(mn,0.56+mn,0.442θ1)2=E((mn,0.56x0.56)+(mn,0.44x0.44)2)2E(mn,0.56x0.56)2+E(mn,0.44x0.44)22=0.44×0.56(f(x0.56))2n1+O(n3/2)=0.2554πθ2n1+O(n3/2),

    whereas

    E(mn,0.5θ1)2=0.785πθ2n1+O(n3/2).

    Obviously, both estimators mn,0.5 and (mn,0.56+mn,0.44)/2 are unbiased for θ1. For large n, the main part 0.2554πθ2n1 of the mean square error (MSE) E[(mn,0.56+mn,0.44)/2θ1]2 is even less than one-third of 0.785πθ2n1, the main part of the MSE E(mn,0.5θ1)2. That is the fundamental reason why Sen obtained in [8] the conclusion that the named optimum mid-range (mn,0.56+mn,0.44)/2 is more effective than the sample median mn,0.5 in estimating θ1.

    By statistical comparison of the scores presented in following Table 1 standing for 30 returns of closing prices of German Stock Index(DAX), Mahdizadeh and Zamanzade reasonably applied the previously mentioned Cauchy distribution (1.11) as a stock market return distribution with θ1 and θ2 being respectively estimated as ^θ1=0.0009629174 and ^θ2=0.003635871 (see [9]).

    Table 1.  Scores for 30 returns of closing prices of DAX.
    0.0011848 -0.0057591 -0.0051393 -0.0051781 0.0020043 0.0017787
    0.0026787 -0.0066238 -0.0047866 -0.0052497 0.0004985 0.0068006
    0.0016206 0.0007411 -0.0005060 0.0020992 -0.0056005 0.0110844
    -0.0009192 0.0019014 -0.0042364 0.0146814 -0.0002242 0.0024545
    -0.0003083 -0.0917876 0.0149552 0.0520705 0.0117482 0.0087458

     | Show Table
    DownLoad: CSV

    Now we utilize (mn,0.56+mn,0.44)/2 as a quick estimator of θ1 and derive a value 0.00105955 which roughly closes to the estimate value 0.0009629174 in reference [9].

    Even now there are many estimate problems (see [10] for a reference) dealing with situations when a population have no expectation, as above analysis, further study on moment convergence for some OSs may be promising.

    Lemma 1. (see [11] and [12]) For a random sequence {ξ1,ξ2,} converging in distribution to a RV ξ which we write as ξnDξ, if d>0 is a constant and the following uniform integrability holds

    limssupnE|ξn|dI|ξn|ds=0,

    then limnE|ξn|d=E|ξ|d and accordingly limnEξnd=Eξd.

    Remark 8. As discarding some definite number of terms from {ξ1,ξ2,} does not affect the conclusion limnE|ξn|d=E|ξ|d, the above condition lims+supnE|ξn|dI|ξn|ds=0 can be replaced by lims+supnME|ξdn|I|ξdn|s=0 for any positive constant M>0.

    Lemma 2. For p(0,1) and a random sample (ξ1,ξ2,,ξn) from a population possessing a continuous pdf f(x), if the p-quantile xp of the population satisfies f(xp)>0, then for the i-th OS ξi:n where i/n=p+o(1), we have ξi:nDxp.

    Proof. Obviously, the sequence {f(xp)(ξi:nxp)p(1p)/n,n=1,2,...} has an asymptotic standard normal distribution N(0,12), thus we see that the statistic ξi:n converges to xp in probability. That leads to the conclusion ξi:nDxp by the reason that, for a sequence of RVs, the convergence to a constant in probability is equivalent to the convergence in distribution.

    Clarification before presenting the proof:

    ● Under the assumption i/n=p+o(1) when n, we would better think of i as a function of n and use the symbol an instead of i. Nevertheless, for simplicity concern, we prefer no adjustment.

    ● Throughout our paper, C1, C2, are some suitable positive constants.

    As inp(0,1) when n, we only need care large numbers n,i and ni.

    Let an integer K>δq be given and M>0 be such a number that if nM, then all the following inequalities i1δq>0, niδq>0, niK>0 and i+Kn<v=1+p2 hold simultaneously. Here the existence of v in the last inequality is ensured by the fact i+Knp as n.

    According to Lemmas 1 and 2 as well as Remark 8, to prove Theorem 1 we only need to show that

    limsδ+supnME|Xδi:n|I|Xδi:n|sδ=0. (3.1)

    That is

    lims+supnM|u|s|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0.

    To show that equation, it suffices for us to prove respectively

    lims+supnM+s|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0

    and

    lims+supnMs|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0.

    Equivalently by putting x=F(u), we need to prove respectively

    limt1supnM1t|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidx=0 (3.2)

    as well as

    limt0+supnMt0|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidx=0.

    As both proofs are similar in fashion, we chose to prove the Eq (3.2) only. Actually, according to the given condition |G(x)|Bxq(1x)q, we see

    limt1supnM1t|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidxBδlimt1supnM1tn!(i1)!(ni)!xi1δq(1x)niδqdxBδlimt1supnM1tn!(i1)!(ni)!(1x)niδqdxBδlimt1supnMn!(i1)!(ni)!(1t)niK(1t)K+1δqBδlimt1supnMn!(1t)niK(i1)!(ni)!C1limx0+supnMn!×ni!(ni)!xniK. (3.3)

    Here the positive number C1>0 exists because n/i=1/p+o(1) where p(0,1).

    Now applying the Stirling's formula n!=2πn(n/e)neθ12n where θ(0,1) (see [13]), we have

    limx0+supnMn!×ni!(ni)!xniKC2limx0+supnM2πn(n/e)n×n2πi(i/e)i2π(ni)((ni)/e)nixniKC3limx0+supnMnn×niini(ni)nixniK=C3limx0+supnMnnii(ni)ninnixniK=C3limx0+supnM1(in)i(1in)ninnixniK=C3limx0+supnM1[(in)in(1in)1in]nnnixniK. (3.4)

    Noting that

    (in)in(1in)1inpp(1p)1p,

    as n, we see that there exists a positive constant, say Q>0 such that

    (in)in(1in)1inQpp(1p)1p

    for all n. Consequently,

    limx0+supnM1[(in)in(1in)1in]nnnixniKlimx0+supnM1[Qpp(1p)1p]nnnixniKC4limx0+supnM1[Qpp(1p)1p]nnxniK. (3.5)

    Due to the assumptions i+Kn<v=1+p2<1 as nM, we derive

    limx0+supnM1[Qpp(1p)1p]nnxniKlimx0+supnM1[Qpp(1p)1p]nnxnvn=limx0+supnM[x1vQpp(1p)1p]nnlimu0+supn1unn. (3.6)

    Finally, by the fact that if u>0 is given sufficiently small, then the first term of the sequence {unn,n1} is the maximum, thus we can confirm

    limu0+supn1unn=limu0+u=0. (3.7)

    Combining the five conclusions numbered from (3.3) to (3.7), we obtain Eq (3.2).

    Here we would like to assume U>1 (or we may use U+2 instead of U).

    By the reason interpreted in Remark 2 and according to condition (1.2), we see that there is a constant A>0 satisfying

    |G(x)xU(1x)U|A. (3.8)

    Now we define Y=F(X) and Yi:n=F(Xi:n) or equivalently X=G(Y) and Xi:n=G(Yi,n), we have G(p)=xp. Obviously, the conclusions in Remark 6 are workable here.

    By the Taylor expansion formula we have

    G(Yi:n)=G(p)+G(p)(Yi:np)+G(p)2!(Yi:np)2+13!G(ξ)(Yi:np)3,

    where

    ξ(min(Yi:n,p),max(Yi:n,p)).

    Noting that almost surely 0<min(Yi:n,p)<ξ<max(Yi:n,p)<1, we obtain

    |EG(Yi:n)G(p)G(p)E(Yi:np)G(p)2E(Yi:np)2|=|E[G(ξ)3!(Yi:np)3]|16|E[AξU(1ξ)U(Yi:np)3]|16|E{A[p(1p)]UYUi:n(1Yi:n)U(Yi:np)3}|16|E{A[p(1p)]U(Yi:np)3}|16A[p(1p)]UE(Yi:np)6=O(n3/2) (3.9)

    by Eq (3.8). Here the last step is in accordance to (1.7).

    Now we can draw the conclusion that

    EG(Yi:n)G(p)G(p)E(Yi:np)12G(p)E(Yi:np)2=o(n1). (3.10)

    That is

    EXi:nxpG(p)(in+1p)12G(p)E(Yi:np)2=o(n1), (3.11)

    provided i/n=p+O(n1).

    Still according to conclusion (1.7), we have

    E(Yi:np)2=O(n1).

    Finally, as i/n=p+O(n1) also guarantees i/(n+1)p=O(n1), we can complete the proof of E(Xi:nxp)=O(n1) or equivalently

    |E(Xi:nxp)|=O(n1)

    by the assertion of (3.11).

    As EZ=0, the proposition holds when m=1, now we only consider the case of m2. By Theorem 1, we see EX2i:nx2p, therefore E|Xs:j| exists for some integer j and s{1,...,j} and Theorem 3 is workable here when we put h(x)=xm. We derive

    E(n1/2f(xp)(Xi:nxp)p(1p))m=xmd(Φ(x)+φ(x)m1i=1ni/2Si,n(x))+O(nm/2)=EZm+m1i=1(ni/2xmd(φ(x)Si,n(x)))+O(nm/2). (3.12)

    Moreover, for given positive integer m2, as the coefficients in polynomial Si,n(x) are uniformly bounded over n and φ(x)=xφ(x), the sequence of the integrals

    {xmd(φ(x)Si,n(x)),n=1,2,...}

    is also uniformly bounded over n. That indicates that

    E(n1/2f(xp)(Xi:nxp)p(1p))m=EZm+O(n1/2) (3.13)

    according to conclusion (3.12).

    As a consequence, we can conclude that for explicitly given m2 the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p))m,n=1,2,...} (3.14)

    is uniformly bounded over n. Moreover, due to the inequality

    |E(n1/2f(xp)(Xi:nxp)p(1p))|E(n1/2f(xp)(Xi:nxp)p(1p))2,

    we see that the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p)),n=1,2,...}

    is also uniformly bounded over n.

    Now that ai:n=xp+O(n1), we complete the proof by the following reasoning

    E(n1/2f(xp)(Xi:nai:n)p(1p))m=E(n1/2f(xp)(Xi:nxp)p(1p)+n1/2f(xp)(xpai:n)p(1p))m=mu=0[(mu)(n1/2f(xp)(xpai:n)p(1p))muE(n1/2f(xp)(Xi:nxp)p(1p))u]=mu=2[(mu)(n1/2f(xp)(xpai:n)p(1p))muE(n1/2f(xp)(Xi:nxp)p(1p))u]+O(n1/2)=mu=2[(mu)(n1/2f(xp)(xpai:n)p(1p))mu(EZu+O(n1/2))]+O(n1/2)=EZm+O(n1/2). (3.15)

    Now we consider the applicability of our theorems obtained so far. As other conditions can be trivially or similarly verified, here we mainly focus on the verification of condition (1.2).

    Example 1: Let the population X have a Cauchy distribution with a pdf f(y)=1π(1+y2),<y<+, correspondingly the inverse function of the cdf of X can be figured out to be

    G(x)=1tan(πx),0<x<1,

    satisfying

    limx0+G(x)x5(1x)5=limx1G(x)x5(1x)5=0.

    Example 2: For Xf(x)=1x(ln(x))2I[e,)(x), we have

    G(x)=e1x1I(0,1)(x),

    and

    limx0+G(x)x(1x)=limx1G(x)x(1x)=0.

    Example 3: For XN(0,12), on that occasion, f(y)=12πey22, f(y)=yf(y) and y=G(x)x=F(y)=y12πet22dt, therefore, as x0+, we have

    (G(x))2ln(x(1x))(G(x))2lnx=y2ln(F(y))y2yF(y)f(y)=2[(yF(y))(f(y))]=2[F(y)+yf(y)yf(y)]=2[F(y)yf(y)1].

    Noting that as x=F(y)0+ or equivalently y,

    F(y)yf(y)f(y)f(y)yf(y)=f(y)f(y)+y2f(y)=11+y20, (4.1)

    we have as x0+,

    (G(x))2ln(x(1x))2.

    By the same fashion, we can show as x1 that

    (G(x))2ln(x(1x))2.

    In conclusion, for x0+ as well as for x1,

    (G(x))22ln(x(1x)). (4.2)

    Accordingly, there exists a positive M>0 such that for all x(0,1),

    (G(x))2M|ln(x(1x))|=Mln(x(1x)). (4.3)

    No matter if x0+ or x1, we get

    |G(x)|=|f(y)f(y)+3(f(y))2(f(y))5|=|(y21)(f(y))2+3(yf(y))2(f(y))5|=2y2+1(f(y))3|y|2y2(f(y))3=2(G(x))2(f(G(x)))34ln(x(1x))(f(G(x)))3. (4.4)

    Here the last step holds in accordance to Eq (4.2).

    For x0+ as well as for x1,

    4ln(x(1x))(f(G(x)))3=4ln(x(1x))(12π)3exp(3(G(x))22)=4(2π)3[ln(x(1x))]exp(3(G(x))22)=4(2π)3[ln(x(1x))][exp((G(x))2)]344(2π)3[ln(x(1x))][exp(Mln(x(1x)))]34=4(2π)3[ln(x(1x))](x(1x))3M4. (4.5)

    Thus we can see the achievement of condition (1.2) by

    limx0+(G(x)xM(1x)M)=limx1(G(x)xM(1x)M)=0. (4.6)

    Remark 9. For a RV X with a cdf F(x) possessing an inverse function G(x), we can prove that if σ>0 and μ(,+) are constants, then the cdf of the RV σX+μ will have an inverse function σG(x)+μ. Thus for the general case XN(μ,σ2), we can still verify the condition (1.2).

    Example 4: For a population XU[a,b], G(x)=(ba)x+a is the inverse function of the cdf of X. As G(x)=0, the assumption of condition (1.2) holds.

    Generally, for any population distributed over an interval [a,b] according to a continuous pdf f(x), if G(0+) and G(1) exist, then the condition (1.2) holds.

    For length concern, here we only point out without detailed proof that for a population X according to a distribution such as Gamma distribution (including special cases such as the Exponential and the Chi-square distributions) and beta distribution and so on, the requirement of condition (1.2) can be satisfied.

    For a random sample (X1,...,Xn) derived from a population X which is uniformly distributed over the interval [0,1], the moment of the ith OS EXi:n=i/(n+1)p if i/np(0,1) as n. Let ai:n=i/n. According to conclusion (1.9) where f(xp)=1 and xp=p(0,1), we have for integer m2,

    E(Xi:nai:n)m=10(xin)mn!(i1)!(ni)!xi1(1x)nidx+o(nm/2)=EZm(p(1p))m2nm2+o(nm/2). (4.7)

    That results in

    n!10(nxi)mxi1(1x)nidx(i1)!(ni)!nm=EZm(pp2)m2nm2+o(nm/2), (4.8)

    or equivalently

    n!mj=0[(mj)nj(i)mjB(i+j,n+1i)](i1)!(ni)!nm=EZm(pp2)m2nm2+o(nm/2).

    Consequently we have the following equation

    n!mj=0[(mj)nj(i)mjΓ(i+j)Γ(n+1i)Γ(i+j+n+1i)](i1)!(ni)!nm=EZm(pp2)m2nm2+o(nm/2),

    which yields

    n!mj=0[(mj)nj(i)mj(i1+j)!(n+j)!](i1)!nm=EZm(pp2)m2nm2+o(nm/2). (4.9)

    As i/np(0,1) when n+, the above equation indicates that

    mj=0[(mj)nj(i)mj(i1+j)!(n+m)!(i1)!(n+j)!]n2m=EZm(pp2)m2nm2+o(nm/2). (4.10)

    For convenience sake, now we denote vk=u=0 and vk=u=1 if v<u. Noting for given explicit integers m2 and j{0,1,...,m} the expression

    (mj)nj(i)mj(i1+j)!(n+m)!(i1)!(n+j)!=(mj)(1)mj(imjjk=1[(i1)+k])(njmk=j+1(n+k)) (4.11)

    is a multinomial of i and n. We see that the nominator of the LHS of Eq (4.10) is also a multinomial which we now denote as

    mj=0[(mj)nj(i)mj(i1+j)!(n+m)!(i1)!(n+j)!]:=ms=0mt=0a(m)s,timsnmt.

    Equivalently, we derive

    mj=0{(mj)(1)mj[imjjk=1(i1+k)][njmk=j+1(n+k)]}=2mk=0s+t=ka(m)s,timsnmt.

    By Eq (4.10), we see for any given p(0,1), if i/np(0,1) as n+, then

    2mk=0s+t=ka(m)s,timsnmtn3m/2=EZm(p(1p))m2+o(1). (4.12)

    Noting that

    s+t=ka(m)s,timsnmt=(s+t=ka(m)s,tpms)n2mk+o(n2mk),

    we see in accordance to (4.12) that

    2mk=0[(s+t=ka(m)s,tpms)n2mk+o(n2mk)]n3m/2=EZm(pp2)m2+o(1). (4.13)

    That indicates that if a non-negative integer k satisfies 2mk>3m/2, or equivalently 0k<m/2, then the coefficient of n2mk in the nominator of LHS of Eq (4.13) must be zero for any given p(0,1), namely

    s+t=ka(m)s,tpms=0,s+t=k<m/2

    holds for any p(0,1). Thereby, for the case of non-negative integers s and t satisfying s+t=k<m/2, we see that the equation a(m)s,t=0 surely holds.

    It is funny to notice that for big m, we immediately have the following three corresponding equations

    mj=0(1)mj(mj)=0,
    mj=2(mj)(1)mjj(j1)2=0,

    and

    m1j=2(mj)(1)mjj(j1)2(mj)(m+j+1)2=0,

    according to the conclusions a(m)0,0=0, a(m)1,0=0 and a(m)1,1=0.

    As for the structure of a(m)s,t when s2, t1 and m>2(s+t), obviously s<mt holds on this occasion and the term a(m)s,timsnmt in the multinomial

    mj=0{(mj)(1)mj[imjjk=1(i1+k)][njmk=j+1(n+k)]}=mj=0{(mj)(1)mj[imjj1k=0(i+k)][njmk=j+1(n+k)]}=mj=0{(mj)(1)mj[imj+1j1k=1(i+k)][njmk=j+1(n+k)]}=(sj=0+mtj=s+1+mj=mt+1){(mj)(1)mj[imj+1j1k=1(i+k)][njmk=j+1(n+k)]}

    is also the term a(m)s,timsnmt in the multinomial

    mtj=s+1{(mj)(1)mj[imj+1j1k=1(i+k)][njmk=j+1(n+k)]}.

    Noting for given j{s,...,mt}, the monomial

    (1u1<u2<...<usj1u1u2...rs)ims

    is the term with degree ms in the polynomial of i

    [imj+1j1k=1(i+k)],

    while the monomial

    (j+1v1<v2<...<vtmv1v2...vt)nmt

    is the term with degree mt in the polynomial of n

    [njmk=j+1(n+k)],

    we see for s+t<m/2,

    a(m)s,t=mtj=s+1((mj)(1)mj1u1<...<usj1u1...usj+1v1<...<vtmv1...vt).

    Now that ams,t=0 holds provided s+t=k<m/2 according to Eq (4.13), we conclude the following Theorem.

    Theorem 5. If s, t and m are integers satisfying s2, t1 and m>2(s+t), then

    mtj=s+1((mj)(1)mj1u1<u2<...<usj1u1...usj+1v1<v2<...<vtmv1...vt)=0.

    Example 5: For big integer m, according to Theorem 5, we have a(m)2,1=0 and a(m)2,2=0. Correspondingly, we obtain equations

    m1j=3((mj)(1)mj(j1i=1i)2(j1i=1i2)2(m+j+1)(mj)2)=0,

    and

    m2j=3((mj)(1)mj(j1i=1i)2(j1i=1i2)2(mi=j+1i)2(mi=j+1i2)2)=0.

    Both equations can be verified by the aid of Maple software.

    Let real δ>0 and integer m>0 be given. For a population satisfying condition (1.1), no matter if the population has an expectation or not, the moment of Xδi:n exists and the sequence {EXδi:n,n1} converges for large i and n satisfying i/np(0,1). Under some further trivial assumptions, for large integer n the mth moment of the standardized sequence {Xi:n,n1} can be approximated by the mth moment of a standard normal distribution EZm.

    Due to the fact that the existence requirement of some expectation Xs:j in Theorem 3 has always been hard to be verified for a population without an expectation, for a long time, real-life world data corresponding to that population of interest has been unavailable in the vast majority of references. Now that the alternative condition (1.8) is presented, maybe things will improve in the future and we still have a long way to go.

    This work was supported by the Science and Technology Plan Projects of Jiangxi Provincial Education Department, grant number GJJ180891.

    There exists no conflict of interest between authors.



    [1] Md. R. Amin, M. R. Roussel, Graph-theoretic analysis of a model for the coupling between photosynthesis and photorespiration, Can. J. Chem., 92 (2014), 85–93. https://doi.org/10.1139/cjc-2013-0315 doi: 10.1139/cjc-2013-0315
    [2] S. Bakshi, A. Siryaporn, M. Goulian, J. C. Weisshaar, Superresolution imaging of ribosomes and RNA polymerase in live Escherichia coli cells, Mol. Microbiol., 85 (2012), 21–38. https://doi.org/10.1111/j.1365-2958.2012.08081.x doi: 10.1111/j.1365-2958.2012.08081.x
    [3] K. Ball, T. G. Kurtz, L. Popovic, G. Rampala, Asymptotic analysis of multiscale approximations to reaction networks, Ann. Appl. Probab., 16 (2006), 1925–1961. https://doi.org/10.1214/105051606000000420 doi: 10.1214/105051606000000420
    [4] A. F. Bartholomay, Enzymatic reaction-rate theory: A stochastic approach, Ann. N. Y. Acad. Sci., 96 (1962), 897–912. https://doi.org/10.1111/j.1749-6632.1962.tb54110.x doi: 10.1111/j.1749-6632.1962.tb54110.x
    [5] A. F. Bartholomay, A stochastic approach to statistical kinetics with application to enzyme kinetics, Biochemistry, 1 (1962), 223–230. https://doi.org/10.1021/bi00908a005 doi: 10.1021/bi00908a005
    [6] R. D. Bliss, Analysis of the Dynamic Behavior of the Tryptophan Operon of Escherichia coli: The Functional Significance of Feedback Inhibition, PhD thesis, University of California Riverside, 1979.
    [7] G. E. Briggs, J. B. S. Haldane, A note on the kinetics of enzyme action, Biochem. J., 19 (1925), 338–339. https://doi.org/10.1042/bj0190338 doi: 10.1042/bj0190338
    [8] S. Busenberg, J. Mahaffy, Interaction of spatial diffusion and delays in models of genetic control by repression, J. Math. Biol., 22 (1985), 313–333. https://doi.org/10.1007/BF00276489 doi: 10.1007/BF00276489
    [9] T. R. Caine Boyde, Foundation Stones of Biochemistry, Voile et Aviron, Hong Kong, 1980.
    [10] K. J. Dale, O. Pourquié, A clock-work somite, BioEssays, 22 (2000), 72–83. https://doi.org/10.1002/(SICI)1521-1878(200001)22:1%3C72::AID-BIES12%3E3.0.CO;2-S doi: 10.1002/(SICI)1521-1878(200001)22:1%3C72::AID-BIES12%3E3.0.CO;2-S
    [11] A. Ecoffet, F. Poitevin, K. D. Duc, MorphOT: Transport-based interpolation between EM maps with UCSF ChimeraX, Bioinformatics, 36 (2020), 5528–5529. https://doi.org/10.1093/bioinformatics/btaa1019 doi: 10.1093/bioinformatics/btaa1019
    [12] A. Ecoffet, G. Woollard, A. Kushner, F. Poitevin, K. D. Duc, Application of transport-based metric for continuous interpolation between cryo-EM density maps, AIMS Math., 7 (2022), 986–999. https://doi.org/10.3934/math.2022059 doi: 10.3934/math.2022059
    [13] B. B. Edelstein, Biochemical model with multiple steady states and hysteresis, J. Theor. Biol., 29 (1970), 57–62. https://doi.org/10.1016/0022-5193(70)90118-9 doi: 10.1016/0022-5193(70)90118-9
    [14] R. Edwards, M. Wood, Branch prioritization motifs in biochemical networks with sharp activation, AIMS Math., 7 (2022), 1115–1146. https://doi.org/10.3934/math.2022066 doi: 10.3934/math.2022066
    [15] J. Eilertsen, M. R. Roussel, S. Schnell, S. Walcher, On the quasi-steady-state approximation in an open Michaelis-Menten reaction mechanism, AIMS Math., 6 (2021), 6781–6814. https://doi.org/10.3934/math.2021398 doi: 10.3934/math.2021398
    [16] N. Fenichel, Persistence and smoothness of invariant manifolds for flows, Indiana U. Math. J., 21 (1971), 193–226. https://doi.org/10.1512/iumj.1972.21.21017 doi: 10.1512/iumj.1972.21.21017
    [17] N. Fenichel, Geometric singular perturbation theory for ordinary differential equations, J. Differential Equations, 31 (1979), 53–98. https://doi.org/10.1016/0022-0396(79)90152-9 doi: 10.1016/0022-0396(79)90152-9
    [18] Herbert C. Friedmann (ed.), Enzymes, Hutchinson Ross Publishing, Stroudsburg, Pa., 1981.
    [19] D. S. Glass, X. Jin, I. H. Riedel-Kruse, Nonlinear delay differential equations and their application to modeling biological network motifs, Nat. Commun., 12 (2021), 1788. https://doi.org/10.1038/s41467-021-21700-8 doi: 10.1038/s41467-021-21700-8
    [20] A. Goeke, S. Walcher, E. Zerz, Determining "small parameters" for quasi-steady state, J. Differential Equations, 259 (2015), 1149–1180. https://doi.org/10.1016/j.jde.2015.02.038 doi: 10.1016/j.jde.2015.02.038
    [21] A. Goldbeter, R. Lefever, Dissipative structures for an allosteric model, Biophys. J., 12 (1972), 1302–1315. https://doi.org/10.1016/S0006-3495(72)86164-2 doi: 10.1016/S0006-3495(72)86164-2
    [22] D. Gonze, W. Abou-Jaoudé, D. A. Ouattara, J. Halloy, How molecular should your molecular model be? On the level of molecular detail required to simulate biological networks in systems and synthetic biology, Meth. Enzymol., 487 (2011), 171–215. https://doi.org/10.1016/B978-0-12-381270-4.00007-X doi: 10.1016/B978-0-12-381270-4.00007-X
    [23] B. C. Goodwin, Temporal Organization in Cells, Academic Press, London, 1963.
    [24] J. S. Griffith, Mathematics of cellular control processes. Ⅰ. Negative feedback to one gene, J. Theor. Biol., 20 (1968), 202–208. https://doi.org/10.1016/0022-5193(68)90189-6 doi: 10.1016/0022-5193(68)90189-6
    [25] R. Grima, S. Schnell, Modelling reaction kinetics inside cells, Essays Biochem., 45 (2008), 41–56. https://doi.org/10.1042/bse0450041 doi: 10.1042/bse0450041
    [26] S. M. Hanson, S. Schnell, Reactant stationary approximation in enzyme kinetics, J. Phys. Chem. A, 112 (2008), 8654–8658. https://doi.org/10.1021/jp8026226 doi: 10.1021/jp8026226
    [27] L. A. Harris, J. S. Hogg, J.-J. Tapia, J. A. P. Sekar, S. Gupta, I. Korsunsky, et al., BioNetGen 2.2: Advances in rule-based modeling, Bioinformatics, 32 (2016), 3366–3368. https://doi.org/10.1093/bioinformatics/btw469 doi: 10.1093/bioinformatics/btw469
    [28] F. G. Heineken, H. M. Tsuchiya, R. Aris, On the mathematical status of the pseudo-steady state hypothesis of biochemical kinetics, Math. Biosci., 1 (1967), 95–113. https://doi.org/10.1016/0025-5564(67)90029-6 doi: 10.1016/0025-5564(67)90029-6
    [29] J. Higgins, A chemical mechanism for oscillation of glycolytic intermediates in yeast cells, Proc. Natl. Acad. Sci. U.S.A., 51 (1964), 989–994. https://doi.org/10.1073/pnas.51.6.989 doi: 10.1073/pnas.51.6.989
    [30] A. V. Hill, The possible effects of the aggregation of the molecules of haemoglobin on its dissociation curves, J. Physiol., 40 (1910), ⅳ–ⅶ.
    [31] W. S. Hlavacek, J. R. Faeder, M. L. Blinov, R. G. Posner, M. Hucka, W. Fontana, Rules for modeling signal-transduction systems, Sci. STKE, (2006), re6. https://doi.org/10.1126/stke.3442006re6 doi: 10.1126/stke.3442006re6
    [32] K. J. Hughes, M. Fairweather, J. F. Griffiths, R. Porter, A. S. Tomlin, The application of the QSSA via reaction lumping for the reduction of complex hydrocarbon oxidation mechanisms, Proc. Combust. Inst., 32 (2009), 543–551. https://doi.org/10.1016/j.proci.2008.06.064 doi: 10.1016/j.proci.2008.06.064
    [33] H. Kacser, J. A. Burns, The control of flux, Symp. Soc. Exp. Biol., 27 (1973), 65–104.
    [34] A. Kicheva, T. Bollenbach, O. Wartlick, F. Jülicher, M. Gonzalez-Gaitan, Investigating the principles of morphogen gradient formation: from tissues to cells, Curr. Opin. Genet. Dev., 22 (2012), 527–532. https://doi.org/10.1016/j.gde.2012.08.004 doi: 10.1016/j.gde.2012.08.004
    [35] T. R. Kiehl, R. M. Mattheyses, M. K. Simmons, Hybrid simulation of cellular behavior, Bioinformatics, 20 (2004), 316–322. https://doi.org/10.1093/bioinformatics/btg409 doi: 10.1093/bioinformatics/btg409
    [36] B. I. Kurganov, A. I. Dorozhko, Z. S. Kagan, V. A. Yakovlev, The theoretical analysis of kinetic behaviour of "hysteretic" allosteric enzymes. Ⅰ. The kinetic manifestations of slow conformational change of an oligomeric enzyme in the Monod, Wyman and Changeux model, J. Theor. Biol., 60 (1976), 247–269. https://doi.org/10.1016/0022-5193(76)90059-X doi: 10.1016/0022-5193(76)90059-X
    [37] K. J. Laidler, Theory of the transient phase in kinetics, with special reference to enzyme systems, Can. J. Chem., 33 (1955), 1614–1624. https://doi.org/10.1139/v55-195 doi: 10.1139/v55-195
    [38] H. D. Landahl, Some conditions for sustained oscillations in biochemical chains with feedback inhibition, Bull. Math. Biophys., 31 (1969), 775–787. https://doi.org/10.1007/BF02477786 doi: 10.1007/BF02477786
    [39] J. Le Sauteur-Robitaille, Z. S. Yu, M. Craig, Impact of estrogen population pharmacokinetics on a QSP model of mammary stem cell differentiation into myoepithelial cells, AIMS Math., 6 (2021), 10861–10880. https://doi.org/10.3934/math.2021631 doi: 10.3934/math.2021631
    [40] D. Lee, A. Koul, N. Lubna, S. A. McKenna, S. Portet, Mathematical modelling of OAS2 activation by dsRNA and effects of dsRNA lengths, AIMS Math., 6 (2021), 5924–5941. https://doi.org/10.3934/math.2021351 doi: 10.3934/math.2021351
    [41] T. I. Lee, N. J. Rinaldi, F. Robert, D. T. Odom, Z. Bar-Joseph, G. K. Gerber, et al., Transcriptional regulatory networks in Saccharomyces cerevisiae, Science, 298 (2002), 799–804. https://doi.org/10.1126/science.1075090 doi: 10.1126/science.1075090
    [42] D. Lloyd, E. L. Rossi, M. R. Roussel, The temporal organization of living systems from molecule to mind, in Ultradian Rhythms from Molecules to Mind (eds. D. Lloyd and E. L. Rossi), Springer, (2008), 1–8.
    [43] C. Macdonald, Gap junctions and cell-cell communication, Essays Biochem., 21 (1985), 86–118.
    [44] P. Macheras, A. Iliadis, Modeling in Biopharmaceutics, Pharmacokinetics and Pharmacodynamics: Homogeneous and Heterogeneous Approaches, vol. 30 of Interdisciplinary Applied Mathematics, Springer, New York, 2005.
    [45] M. C. Mackey, L. Glass, Oscillation and chaos in physiological control systems, Science, 197 (1977), 287–289. https://doi.org/10.1126/science.267326 doi: 10.1126/science.267326
    [46] M. C. Mackey, M. Santillán, M. Tyran-Kamińska, E. S. Zeron, Simple Mathematical Models of Gene Regulatory Dynamics, Lecture Notes on Mathematical Modelling in the Life Sciences, Springer, Cham, Switzerland, 2016.
    [47] J. Maynard Smith, Mathematical Ideas in Biology, Cambridge University Press, Cambridge, 1968.
    [48] H. G. Othmer, A continuum model for coupled cells, J. Math. Biol., 17 (1983), 351–369. https://doi.org/10.1007/BF00276521 doi: 10.1007/BF00276521
    [49] L. Ouellet, K. J. Laidler, Theory of the transient phase in kinetics, with special reference to enzyme systems — Ⅱ. The case of two enzyme-substrate complexes, Can. J. Chem., 34 (1956), 146–150. https://doi.org/10.1139/v56-018 doi: 10.1139/v56-018
    [50] J. Pantoja-Hernández, M. Santillán, Segmentation-clock synchronization in circular-lattice networks of embryonic presomitic-mesoderm cells, AIMS Math., 6 (2021), 5817–5836. https://doi.org/10.3934/math.2021344 doi: 10.3934/math.2021344
    [51] L. Petzold, W. Zhu, Model reduction for chemical kinetics: An optimization approach, AIChE J., 45 (1999), 869–886. https://doi.org/10.1002/aic.690450418 doi: 10.1002/aic.690450418
    [52] I. Prigogine, R. Lefever, A. Goldbeter, M. Herschkowitz-Kaufman, Symmetry breaking instabilities in biological systems, Nature, 223 (1969), 913–916. https://doi.org/10.1038/223913a0 doi: 10.1038/223913a0
    [53] M. Ptashnyk, Multiscale modelling and analysis of signalling processes in tissues with non-periodic distribution of cells, Vietnam J. Math., 45 (2017), 295–316. https://doi.org/10.1007/s10013-016-0232-9 doi: 10.1007/s10013-016-0232-9
    [54] O. Radulescu, A. N. Gorban, A. Zinovyev, V. Noel, Reduction of dynamical biochemical reactions networks in computational biology, Front. Genet., 3 (2012), 131. https://doi.org/10.3389/fgene.2012.00131 doi: 10.3389/fgene.2012.00131
    [55] O. Radulescu, A. N. Gorban, A. Zinovyev, A. Lilienbaum, Robust simplifications of multiscale biochemical networks, BMC Syst. Biol., 2 (2008), 86. https://doi.org/10.1186/1752-0509-2-86 doi: 10.1186/1752-0509-2-86
    [56] M. R. Roussel, The use of delay differential equations in chemical kinetics, J. Phys. Chem., 100 (1996), 8323–8330. https://doi.org/10.1021/jp9600672 doi: 10.1021/jp9600672
    [57] M. A. Savageau, The behavior of intact biochemical control systems, Curr. Topics Cell. Reg., 6 (1972), 63–130. https://doi.org/10.1016/B978-0-12-152806-5.50010-2 doi: 10.1016/B978-0-12-152806-5.50010-2
    [58] L. A. Segel, M. Slemrod, The quasi-steady-state assumption: A case study in perturbation, SIAM Rev., 31 (1989), 446–477. https://doi.org/10.1137/1031091 doi: 10.1137/1031091
    [59] P. K. Sorger, S. R. Allerheiligen, D. R. Abernethy, R. B. Altman, K. L. R. Brouwer, A. Califano, et al., Quantitative and Systems Pharmacology in the Post-genomic Era: New Approaches to Discovering Drugs and Understanding Therapeutic Mechanisms, Technical report, National Institutes of Health, 2011. Available from: https://www.nigms.nih.gov/training/documents/systemspharmawpsorger2011.pdf.
    [60] I. Stoleriu, F. A. Davidson, J. L. Liu, Quasi-steady state assumptions for non-isolated enzyme-catalyzed reactions, J. Math. Biol., 48 (2004), 82–104. https://doi.org/10.1007/s00285-003-0225-7 doi: 10.1007/s00285-003-0225-7
    [61] P. Thomas, A. V. Straube, R. Grima, Limitations of the stochastic quasi-steady-state approximation in open biochemical reaction networks, J. Chem. Phys., 135 (2011), 181103. https://doi.org/10.1063/1.3661156 doi: 10.1063/1.3661156
    [62] P. P. Thumfort, D. B. Layzell, C. A. Atkins, A simplified approach for modeling diffusion into cells, J. Theor. Biol., 204 (2000), 47–65. https://doi.org/10.1006/jtbi.2000.1071 doi: 10.1006/jtbi.2000.1071
    [63] T. Turányi, Reduction of large reaction mechanisms, New J. Chem., 14 (1990), 795–803.
    [64] C. Walter, Enzyme Kinetics: Open and Closed Systems, Ronald Press, New York, 1966.
    [65] L. E. Whitehouse, A. S. Tomlin, M. J. Pilling, Systematic reduction of complex tropospheric chemical mechanisms, Part Ⅰ: Sensitivity and time-scale analyses, Atmos. Chem. Phys., 4 (2004), 2025–2056. https://doi.org/10.5194/acp-4-2025-2004 doi: 10.5194/acp-4-2025-2004
    [66] D. M. Wolf, A. P. Arkin, Motifs, modules and games in bacteria, Curr. Opin. Microbiol., 6 (2003), 125–134. https://doi.org/10.1016/S1369-5274(03)00033-X doi: 10.1016/S1369-5274(03)00033-X
  • This article has been cited by:

    1. Saeed M. Ali, Mohammed D. Kassim, Sufficient Conditions for the Non-Existence of Global Solutions to Fractional Systems with Lower-Order Hadamard-Type Fractional Derivatives, 2025, 13, 2227-7390, 1031, 10.3390/math13071031
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3066) PDF downloads(98) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog