中国科学院数学与系统科学研究院期刊网

2020年, 第36卷, 第3期　刊出日期：2020-07-15
  

  • 全选
    |
  • Isolated Toughness and k-Hamiltonian[a, b]-factors
    Zhi-ren SUN, Si-zhong ZHOU
    应用数学学报(英文版). 2020, 36(3): 539-544. https://doi.org/10.1007/s10255-020-0963-y
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let a, b and k be nonnegative integers with a ≥ 2 and b ≥ a(k + 1) + 2. A graph G is called a k-Hamiltonian graph if after deleting any k vertices of G the remaining graph of G has a Hamiltonian cycle. A graph G is said to have a k-Hamiltonian[a, b]-factor if after deleting any k vertices of G the remaining graph of G admits a Hamiltonian[a, b]-factor. Let G is a k-Hamiltonian graph of order n with n ≥ a + k + 2. In this paper, it is proved that G contains a k-Hamiltonian[a, b]-factor if δ(G) ≥ a + k and δ(G) ≥ I(G) ≥ a-1 + ((a(k+1))/b-2).
  • Regression Analysis for the Additive Hazards Model with General Biased Survival Data
    Xiao-lin CHEN
    应用数学学报(英文版). 2020, 36(3): 545-556. https://doi.org/10.1007/s10255-020-0949-9
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In survival analysis, data are frequently collected by some complex sampling schemes, e.g., length biased sampling, case-cohort sampling and so on. In this paper, we consider the additive hazards model for the general biased survival data. A simple and unified estimating equation method is developed to estimate the regression parameters and baseline hazard function. The asymptotic properties of the resulting estimators are also derived. Furthermore, to check the adequacy of the fitted model with general biased survival data, we present a test statistic based on the cumulative sum of the martingale-type residuals. Simulation studies are conducted to evaluate the performance of proposed methods, and applications to the shrub and Welsh Nickel Refiners datasets are given to illustrate the methodology.
  • Nearly Uniform Design Construction on Flexible Region
    Jian-hui NING, Wen-wen YIN, Li PENG
    应用数学学报(英文版). 2020, 36(3): 557-565. https://doi.org/10.1007/s10255-020-0961-0
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we deduced an iteration formula for the computation of central composite discrepancy. By using the iteration formula, the computational complexity of uniform design construction in flexible region can be greatly reduced. And we also made a refinement to threshold accepting algorithm to accelerate the algorithm's convergence rate. Examples show that the refined algorithm can converge to the lower discrepancy design more stably.
  • Tests for p-regression Coefficients in Linear Panel Model When p is Divergent
    Jing ZHAO, Mi-xia WU, Wei-hu CHENG, Yao-hua RONG, Yu-ping HU
    应用数学学报(英文版). 2020, 36(3): 566-580. https://doi.org/10.1007/s10255-020-0947-y
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper evaluates the performance of the FW -test for testing part of p-regression coefficients in linear panel data model when p is divergent. The asymptotic power of the FW -statistic is obtained under some regular conditions. The theoretical development are challenging since the number of covariates increases as the sample size increases. It is worth noting that the inference approach does not require any specification of the error distribution. Some simulation comparisons are conducted and show that the simulated power coincide with theoretical power well. The method is also illustrated using a renal cancer data example.
  • Acyclic Edge Coloring of IC-planar Graphs
    Wen-yao SONG, Yuan-yuan DUAN, Juan WANG, Lian-ying MIAO
    应用数学学报(英文版). 2020, 36(3): 581-589. https://doi.org/10.1007/s10255-020-0950-3
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G is the least number of colors such that G has an acyclic edge coloring and denoted by χ'a(G). An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. In this paper, it is proved that χ'a(G) ≤ △(G) + 10, if G is an IC-planar graph without adjacent triangles and χ'a(G) ≤ △(G) + 8, if G is a triangle-free IC-planar graph.
  • Log-behavior of Two Sequences Related to the Elliptic Integrals
    Brian Yi SUN, James Jing-Yu ZHAO
    应用数学学报(英文版). 2020, 36(3): 590-602. https://doi.org/10.1007/s10255-020-0952-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Two interesting sequences arose in the study of the series expansions of the complete elliptic integrals, which are called the Catalan-Larcombe-French sequence {Pn}n ≥ 0 and the Fennessey-Larcombe-French sequence {Vn}n ≥ 0 respectively. In this paper, we first establish some criteria for determining log-behavior of a sequence based on its three-term recurrence. Then we prove the log-convexity of {Vn2-Vn-1Vn+1}n ≥ 2 and {n!Vn}n ≥ 1, the ratio log-concavity of {Pn}n ≥ 0 and the sequence {An}n ≥ 0 of Apéry numbers, and the ratio log-convexity of {Vn}n ≥ 1.
  • Antimagicness of Lexicographic Product Graph G[Pn]
    Ying-yu LU, Guang-hua DONG, Ning WANG
    应用数学学报(英文版). 2020, 36(3): 603-619. https://doi.org/10.1007/s10255-020-0953-0
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic. Since then, many classes of graphs have been proved to be antimagic. But few is known about the antimagicness of lexicographic product graphs. In this paper, via the construction of a directed Eulerian circuit, the Siamese method, and some modification on graph labeling, the antimagicness of lexicographic product graph G[Pn] is obtained.
  • A Generalization of Implicit Ore-condition for Hamiltonicity of k-connected Graphs
    Jun-qing CAI, Lin WANG
    应用数学学报(英文版). 2020, 36(3): 620-626. https://doi.org/10.1007/s10255-020-0956-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In 2005, Flandrin et al. proved that if G is a k-connected graph of order n and V(G)=X1 ∪ X2 ∪ … ∪ Xk such that d(x)+ d(y) ≥ n for each pair of nonadjacent vertices x, y ∈ Xi and each i with i=1, 2, …, k, then G is hamiltonian. In order to get more sufficient conditions for hamiltonicity of graphs, Zhu, Li and Deng proposed the definitions of two kinds of implicit degree of a vertex v, denoted by id1(v) and id2(v), respectively. In this paper, we are going to prove that if G is a k-connected graph of order n and V (G)=X1 ∪ X2 ∪ … ∪ Xk such that id2(x) + id2(y) ≥ n for each pair of nonadjacent vertices x, y ∈ Xi and each i with i=1, 2, …, k, then G is hamiltonian.
  • Harnack Inequality and Applications for SDEs Driven by G-Brownian Motion
    Fen-fen YANG
    应用数学学报(英文版). 2020, 36(3): 627-635. https://doi.org/10.1007/s10255-020-0957-9
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, Wang's Harnack and shift Harnack inequality for a class of stochastic differential equations driven by G-Brownian motion are established. The results generalize the ones in the linear expectation setting. Moreover, some applications are also given.
  • Perfect Matching in k-partite k-graphs and 3-uniform HM-bipartite Hypergraphs
    Chun-qiu FANG, Mei LU
    应用数学学报(英文版). 2020, 36(3): 636-641. https://doi.org/10.1007/s00000-020-0962-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let H=(V, E) be an n-balanced k-partite k-graph with partition classes V1, …, Vk. Suppose for every legal (k-1)-tuple f contained in V \ V1 and for every legal (k-1)-tuple g contained in V \ Vk such that f ∪ g∉ E(H), we have d(f) + d(g) ≥ n + 1. In this paper, we prove that under this condition H must have a perfect matching. Another result of this paper is about the perfect matching in 3-uniform hm-bipartite hypergraphs. Let G be a 3-uniform hm-bipartite hypergraph with one of whose sides V1 has the size n, the another side V2 has size 2n. If for all the legal 2-tuple f with|f ∩ V1|=1 and for all the legal 2-tuple g with|g ∩ V1|=0, we have d(f) ≥ n-2 and d(g) > n/2, then G has a perfect matching.
  • Semiparametric Likelihood-based Inference for Censored Data with Auxiliary Information from External Massive Data Sources
    Yue-xin FANG, Yong ZHOU
    应用数学学报(英文版). 2020, 36(3): 642-656. https://doi.org/10.1007/s10255-020-0948-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Published auxiliary information can be helpful in conducting statistical inference in a new study. In this paper, we synthesize the auxiliary information with semiparametric likelihood-based inference for censoring data with the total sample size is available. We express the auxiliary information as constraints on the regression coefficients and the covariate distribution, then use empirical likelihood method for general estimating equations to improve the efficiency of the interested parameters in the specified model. The consistency and asymptotic normality of the resulting regression parameter estimators established. Also numerical simulation and application with different supposed conditions show that the proposed method yields a substantial gain in efficiency of the interested parameters.
  • The Stability of Nontrivial Positive Steady States for the SKT Model with Large Cross Diffusion
    Qing LI, Qian XU
    应用数学学报(英文版). 2020, 36(3): 657-669. https://doi.org/10.1007/s10255-020-0951-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper is concerned with the existence and stability of steady state solutions for the SKT biological competition model with cross-diffusion.
    By applying the detailed spectral analysis and in virtue of the bifurcating direction to the limiting system as the cross diffusion rate tends to infinity, it is proved the stability/instability of the nontrivial positive steady states with some special bifurcating structure.
    Further, the existence and stability/instability of the corresponding nontrivial positive steady states for the original cross-diffusion system are proved by applying perturbation argument.
  • The Law of Logarithm for Arrays of Random Variables under Sub-linear Expectations
    Jia-pan XU, Li-xin ZHANG
    应用数学学报(英文版). 2020, 36(3): 670-688. https://doi.org/10.1007/s10255-020-0958-8
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Under the framework of sub-linear expectation initiated by Peng, motivated by the concept of extended negative dependence, we establish a law of logarithm for arrays of row-wise extended negatively dependent random variables under weak conditions. Besides, the law of logarithm for independent and identically distributed arrays is derived more precisely and the sufficient and necessary conditions for the law of logarithm are obtained.
  • Numerical Approximation of Stochastic Theta Method for Random Periodic Solution of Stochastic Differential Equations
    Rong WEI, Chuan-zhong CHEN
    应用数学学报(英文版). 2020, 36(3): 689-701. https://doi.org/10.1007/s10255-020-0959-7
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we make use of stochastic theta method to study the existence of the numerical approximation of random periodic solution. We prove that the error between the exact random periodic solution and the approximated one is at the 1/4 order time step in mean sense when the initial time tends to ∞.
  • Learning Causal Effect Using Machine Learning with Application to China's Typhoon
    Peng WU, Qi-rui HU, Xing-wei TONG, Min WU
    应用数学学报(英文版). 2020, 36(3): 702-713. https://doi.org/10.1007/s10255-020-0960-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Matching is a routinely used technique to balance covariates and thereby alleviate confounding bias in causal inference with observational data. Most of the matching literatures involve the estimating of propensity score with parametric model, which heavily depends on the model specification. In this paper, we employ machine learning and matching techniques to learn the average causal effect. By comparing a variety of machine learning methods in terms of propensity score under extensive scenarios, we find that the ensemble methods, especially generalized random forests, perform favorably with others. We apply all the methods to the data of tropical storms that occurred on the mainland of China since 1949.
  • A New QP-free Algorithm Without a Penalty Function or a Filter for Nonlinear Semidefinite Programming
    Jian-ling LI, Zhen-ping YANG, Jia-qi WU, Jin-bao JIAN
    应用数学学报(英文版). 2020, 36(3): 714-736. https://doi.org/10.1007/s10255-020-0964-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we present a QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming. At each iteration, two systems of linear equations with the same coefficient matrix are solved to determine search direction; the nonmonotone line search ensures that the objective function or constraint violation function is sufficiently reduced. There is no feasibility restoration phase in our algorithm, which is necessary for traditional filter methods. The proposed algorithm is globally convergent under some mild conditions. Preliminary numerical results indicate that the proposed algorithm is comparable.
  • List Edge Coloring of Outer-1-planar Graphs
    Xin ZHANG
    应用数学学报(英文版). 2020, 36(3): 737-752. https://doi.org/10.1007/s10255-020-0940-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is known that the list edge chromatic number χ'l(G) of any outer-1-planar graph G with maximum degree △(G) ≥ 5 is exactly its maximum degree. In this paper, we prove χ'l(G)=△(G) for outer-1-planar graphs G with △(G)=4 and with the crossing distance being at least 3.
  • An Efficient Parameterized Logarithmic Kernel Function for Semidefinite Optimization
    Louiza DERBAL, Zakia KEBBICHE
    应用数学学报(英文版). 2020, 36(3): 753-770. https://doi.org/10.1007/s10255-020-0955-y
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we present a primal-dual interior point algorithm for semidefinite optimization problems based on a new class of kernel functions. These functions constitute a combination of the classic kernel function and a barrier term.
    We derive the complexity bounds for large and small-update methods respectively. We show that the best result of iteration bounds for large and small-update methods can be achieved, namely O(q√n(log √n) q+1/q log n/ε) for large-update methods and O(q3/2 (log √q)q+1/q √n log n/ε) for small-update methods.
    We test the efficiency and the validity of our algorithm by running some computational tests, then we compare our numerical results with results obtained by algorithms based on different kernel functions.
在线期刊
新闻公告 更多