In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order ...In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order regular variation condition.展开更多
As the EU passes the first AI law,the U.S.grapples with bipartisanship,and China proactively advances the issue-based approach and advocates the Global AI Governance Initiative,will AI become“a force for good,ensurin...As the EU passes the first AI law,the U.S.grapples with bipartisanship,and China proactively advances the issue-based approach and advocates the Global AI Governance Initiative,will AI become“a force for good,ensuring safety,and promoting fairness”?展开更多
In this paper,we justify the convergence from the two-species Vlasov-PoissonBoltzmann(VPB,for short)system to the two-fluid incompressible Navier-Stokes-FourierPoisson(NSFP,for short)system with Ohm’s law in the cont...In this paper,we justify the convergence from the two-species Vlasov-PoissonBoltzmann(VPB,for short)system to the two-fluid incompressible Navier-Stokes-FourierPoisson(NSFP,for short)system with Ohm’s law in the context of classical solutions.We prove the uniform estimates with respect to the Knudsen numberεfor the solutions to the two-species VPB system near equilibrium by treating the strong interspecies interactions.Consequently,we prove the convergence to the two-fluid incompressible NSFP asεgoes to 0.展开更多
This article is concerned with the pointwise error estimates for vanishing vis- cosity approximations to scalar convex conservation laws with boundary.By the weighted error function and a bootstrap extrapolation techn...This article is concerned with the pointwise error estimates for vanishing vis- cosity approximations to scalar convex conservation laws with boundary.By the weighted error function and a bootstrap extrapolation technique introduced by Tadmor-Tang,an optimal pointwise convergence rate is derived for the vanishing viscosity approximations to the initial-boundary value problem for scalar convex conservation laws,whose weak entropy solution is piecewise C 2 -smooth with interaction of elementary waves and the ...展开更多
We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann's strong law of large numbers and Teicher's strong law of large nnum...We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann's strong law of large numbers and Teicher's strong law of large nnumbers for independent random variables are generalized to the case of φ -minxing random variables.展开更多
In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the ...In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the classical weak law of large numbers, etc. from independent sequences of random variables to ρ-mixing sequences of random variables without necessarily adding any extra conditions.展开更多
A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming (SOCP) by using the Alizadeh- Haeberly-Overton (AHO) search direction. This algorith...A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming (SOCP) by using the Alizadeh- Haeberly-Overton (AHO) search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O(√n ln(ε0/ε)) iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.展开更多
In this paper, we will present some strong convergence results for sequences of ψ-mixing random variables. The results for sequences of ψ-mixing random variables generalize the corresponding results for independent ...In this paper, we will present some strong convergence results for sequences of ψ-mixing random variables. The results for sequences of ψ-mixing random variables generalize the corresponding results for independent random variable sequences without any extra conditions.展开更多
We are interested in the convergence rates of the submartingale Wn=Z_(n)/Π_(n)to its limit W,where(Π_(n))is the usually used norming sequence and(Z_(n))is a supercritical branching process with immigration(Y_(n))in ...We are interested in the convergence rates of the submartingale Wn=Z_(n)/Π_(n)to its limit W,where(Π_(n))is the usually used norming sequence and(Z_(n))is a supercritical branching process with immigration(Y_(n))in a stationary and ergodic environmentξ.Under suitable conditions,we establish the following central limit theorems and results about the rates of convergence in probability or in law:(i)W-W_(n) with suitable normalization converges to the normal law N(0,1),and similar results also hold for W_(n+k)-W_(n) for each fixed k∈N^(*);(ii)for a branching process with immigration in a finite state random environment,if W_(1) has a finite exponential moment,then so does W,and the decay rate of P(|W-W_(n)|>ε)is supergeometric;(iii)there are normalizing constants an(ξ)(that we calculate explicitly)such that a_(n)(ξ)(W-W_(n))converges in law to a mixture of the Gaussian law.展开更多
In this paper, by the three series theorem of m-negatively associated(m-NA,in short) random variables and the truncation method of random variables, we mainly investigated the strong convergence properties for partial...In this paper, by the three series theorem of m-negatively associated(m-NA,in short) random variables and the truncation method of random variables, we mainly investigated the strong convergence properties for partial sums of m-NA random variables.In addition, the Khintchine-Kolmogorov convergence theorem and Kolmogorov-type strong law of large numbers for m-NA random variables are also obtained. The results obtained in the paper generalize some corresponding ones for independent random variables and some dependent random variables.展开更多
This article is concerned with the estimating problem of semiparametric varyingcoefficient partially linear regression models. By combining the local polynomial and least squares procedures Fan and Huang (2005) prop...This article is concerned with the estimating problem of semiparametric varyingcoefficient partially linear regression models. By combining the local polynomial and least squares procedures Fan and Huang (2005) proposed a profile least squares estimator for the parametric component and established its asymptotic normality. We further show that the profile least squares estimator can achieve the law of iterated logarithm. Moreover, we study the estimators of the functions characterizing the non-linear part as well as the error variance. The strong convergence rate and the law of iterated logarithm are derived for them, respectively.展开更多
Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algor...Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton (AHO) directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O(rln(εo/ε)) is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.展开更多
We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale differen...We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.展开更多
In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones...In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.展开更多
This paper addresses the design of an exponential function-based learning law for artificial neural networks(ANNs)with continuous dynamics.The ANN structure is used to obtain a non-parametric model of systems with unc...This paper addresses the design of an exponential function-based learning law for artificial neural networks(ANNs)with continuous dynamics.The ANN structure is used to obtain a non-parametric model of systems with uncertainties,which are described by a set of nonlinear ordinary differential equations.Two novel adaptive algorithms with predefined exponential convergence rate adjust the weights of the ANN.The first algorithm includes an adaptive gain depending on the identification error which accelerated the convergence of the weights and promotes a faster convergence between the states of the uncertain system and the trajectories of the neural identifier.The second approach uses a time-dependent sigmoidal gain that forces the convergence of the identification error to an invariant set characterized by an ellipsoid.The generalized volume of this ellipsoid depends on the upper bounds of uncertainties,perturbations and modeling errors.The application of the invariant ellipsoid method yields to obtain an algorithm to reduce the volume of the convergence region for the identification error.Both adaptive algorithms are derived from the application of a non-standard exponential dependent function and an associated controlled Lyapunov function.Numerical examples demonstrate the improvements enforced by the algorithms introduced in this study by comparing the convergence settings concerning classical schemes with non-exponential continuous learning methods.The proposed identifiers overcome the results of the classical identifier achieving a faster convergence to an invariant set of smaller dimensions.展开更多
Let fX;Xn;n≥1g be a sequence of identically distributed pairwise negative quadrant dependent(PNQD)random variables and fan;n1g be a sequence of positive constants with an=f(n)and f(θ^k)=f(θ^k-1)for all large posit...Let fX;Xn;n≥1g be a sequence of identically distributed pairwise negative quadrant dependent(PNQD)random variables and fan;n1g be a sequence of positive constants with an=f(n)and f(θ^k)=f(θ^k-1)for all large positive integers k,where 1<θ≤βand f(x)>0(x≥1)is a non-decreasing function on[b;+1)for some b≥1:In this paper,we obtain the strong law of large numbers and complete convergence for the sequence fX;Xn;n≥1g,which are equivalent to the general moment conditionΣ∞n=1P(|X|>an)<1.Our results extend and improve the related known works in Baum and Katz[1],Chen at al.[3],and Sung[14].展开更多
We address the problem of convergence of approximations obtained from two versions of the piecewise power-law representations arisen in Systems Biology. The most important cases of mean-square and uniform convergence ...We address the problem of convergence of approximations obtained from two versions of the piecewise power-law representations arisen in Systems Biology. The most important cases of mean-square and uniform convergence are studied in detail. Advantages and drawbacks of the representations as well as properties of both kinds of convergence are discussed. Numerical approximation algorithms related to piecewise power-law representations are described in Appendix.展开更多
文摘In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order regular variation condition.
文摘As the EU passes the first AI law,the U.S.grapples with bipartisanship,and China proactively advances the issue-based approach and advocates the Global AI Governance Initiative,will AI become“a force for good,ensuring safety,and promoting fairness”?
文摘In this paper,we justify the convergence from the two-species Vlasov-PoissonBoltzmann(VPB,for short)system to the two-fluid incompressible Navier-Stokes-FourierPoisson(NSFP,for short)system with Ohm’s law in the context of classical solutions.We prove the uniform estimates with respect to the Knudsen numberεfor the solutions to the two-species VPB system near equilibrium by treating the strong interspecies interactions.Consequently,we prove the convergence to the two-fluid incompressible NSFP asεgoes to 0.
基金supported by the NSF China#10571075NSF-Guangdong China#04010473+1 种基金The research of the second author was supported by Jinan University Foundation#51204033the Scientific Research Foundation for the Returned Overseas Chinese Scholars,State education Ministry#2005-383
文摘This article is concerned with the pointwise error estimates for vanishing vis- cosity approximations to scalar convex conservation laws with boundary.By the weighted error function and a bootstrap extrapolation technique introduced by Tadmor-Tang,an optimal pointwise convergence rate is derived for the vanishing viscosity approximations to the initial-boundary value problem for scalar convex conservation laws,whose weak entropy solution is piecewise C 2 -smooth with interaction of elementary waves and the ...
基金Supported by the National Natural Science Foundation of China (10671149)
文摘We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann's strong law of large numbers and Teicher's strong law of large nnumbers for independent random variables are generalized to the case of φ -minxing random variables.
文摘In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the classical weak law of large numbers, etc. from independent sequences of random variables to ρ-mixing sequences of random variables without necessarily adding any extra conditions.
基金the National Science Foundation(60574075, 60674108)
文摘A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming (SOCP) by using the Alizadeh- Haeberly-Overton (AHO) search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O(√n ln(ε0/ε)) iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.
基金Supported by the University Students Science Research Training Program of Anhui University(KYXL20110004)
文摘In this paper, we will present some strong convergence results for sequences of ψ-mixing random variables. The results for sequences of ψ-mixing random variables generalize the corresponding results for independent random variable sequences without any extra conditions.
基金supported by the National Natural Science Foundation of China(11571052,11731012)the Hunan Provincial Natural Science Foundation of China(2018JJ2417)the Open Fund of Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering(2018MMAEZD02)。
文摘We are interested in the convergence rates of the submartingale Wn=Z_(n)/Π_(n)to its limit W,where(Π_(n))is the usually used norming sequence and(Z_(n))is a supercritical branching process with immigration(Y_(n))in a stationary and ergodic environmentξ.Under suitable conditions,we establish the following central limit theorems and results about the rates of convergence in probability or in law:(i)W-W_(n) with suitable normalization converges to the normal law N(0,1),and similar results also hold for W_(n+k)-W_(n) for each fixed k∈N^(*);(ii)for a branching process with immigration in a finite state random environment,if W_(1) has a finite exponential moment,then so does W,and the decay rate of P(|W-W_(n)|>ε)is supergeometric;(iii)there are normalizing constants an(ξ)(that we calculate explicitly)such that a_(n)(ξ)(W-W_(n))converges in law to a mixture of the Gaussian law.
基金Supported by the Natural Science Foundation of Anhui Province(1508085J06) the Key Projects for Academic Talent of Anhui Province(gxbj ZD2016005) the Students Innovative Training Project of Anhui University(201610357001)
文摘In this paper, by the three series theorem of m-negatively associated(m-NA,in short) random variables and the truncation method of random variables, we mainly investigated the strong convergence properties for partial sums of m-NA random variables.In addition, the Khintchine-Kolmogorov convergence theorem and Kolmogorov-type strong law of large numbers for m-NA random variables are also obtained. The results obtained in the paper generalize some corresponding ones for independent random variables and some dependent random variables.
基金supported by the National Natural Science Funds for Distinguished Young Scholar (70825004)National Natural Science Foundation of China (NSFC) (10731010 and 10628104)+3 种基金the National Basic Research Program (2007CB814902)Creative Research Groups of China (10721101)Leading Academic Discipline Program, the 10th five year plan of 211 Project for Shanghai University of Finance and Economics211 Project for Shanghai University of Financeand Economics (the 3rd phase)
文摘This article is concerned with the estimating problem of semiparametric varyingcoefficient partially linear regression models. By combining the local polynomial and least squares procedures Fan and Huang (2005) proposed a profile least squares estimator for the parametric component and established its asymptotic normality. We further show that the profile least squares estimator can achieve the law of iterated logarithm. Moreover, we study the estimators of the functions characterizing the non-linear part as well as the error variance. The strong convergence rate and the law of iterated logarithm are derived for them, respectively.
基金supported by the National Natural Science Foundation of China (Nos. 71061002 and 11071158)the Natural Science Foundation of Guangxi Province of China (Nos. 0832052 and 2010GXNSFB013047)
文摘Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton (AHO) directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O(rln(εo/ε)) is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.
基金Supported by the National Natural Science Foundationof China (10671149)
文摘We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.
基金Supported by the National Natural Science Foundation of China(11671012, 11526033, 11501004, 11501005) Supported by the Natural Science Foundation of Anhui Province(1608085QA02) Supported by the Science Fund for Distinguished Young Scholars of Anhui Province(1508085J06)
文摘In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.
基金supported by the National Polytechnic Institute(SIP-20221151,SIP-20220916)。
文摘This paper addresses the design of an exponential function-based learning law for artificial neural networks(ANNs)with continuous dynamics.The ANN structure is used to obtain a non-parametric model of systems with uncertainties,which are described by a set of nonlinear ordinary differential equations.Two novel adaptive algorithms with predefined exponential convergence rate adjust the weights of the ANN.The first algorithm includes an adaptive gain depending on the identification error which accelerated the convergence of the weights and promotes a faster convergence between the states of the uncertain system and the trajectories of the neural identifier.The second approach uses a time-dependent sigmoidal gain that forces the convergence of the identification error to an invariant set characterized by an ellipsoid.The generalized volume of this ellipsoid depends on the upper bounds of uncertainties,perturbations and modeling errors.The application of the invariant ellipsoid method yields to obtain an algorithm to reduce the volume of the convergence region for the identification error.Both adaptive algorithms are derived from the application of a non-standard exponential dependent function and an associated controlled Lyapunov function.Numerical examples demonstrate the improvements enforced by the algorithms introduced in this study by comparing the convergence settings concerning classical schemes with non-exponential continuous learning methods.The proposed identifiers overcome the results of the classical identifier achieving a faster convergence to an invariant set of smaller dimensions.
基金Supported by the National Natural Science Foundation of China(No.11271161).
文摘Let fX;Xn;n≥1g be a sequence of identically distributed pairwise negative quadrant dependent(PNQD)random variables and fan;n1g be a sequence of positive constants with an=f(n)and f(θ^k)=f(θ^k-1)for all large positive integers k,where 1<θ≤βand f(x)>0(x≥1)is a non-decreasing function on[b;+1)for some b≥1:In this paper,we obtain the strong law of large numbers and complete convergence for the sequence fX;Xn;n≥1g,which are equivalent to the general moment conditionΣ∞n=1P(|X|>an)<1.Our results extend and improve the related known works in Baum and Katz[1],Chen at al.[3],and Sung[14].
文摘We address the problem of convergence of approximations obtained from two versions of the piecewise power-law representations arisen in Systems Biology. The most important cases of mean-square and uniform convergence are studied in detail. Advantages and drawbacks of the representations as well as properties of both kinds of convergence are discussed. Numerical approximation algorithms related to piecewise power-law representations are described in Appendix.