Improving the approximation of the probability density function of random nonautonomous logistic‐type differential equations

In this paper, we address the problem of approximating the probability density function of the following random logistic differential equation: P^′(t,ω)=A(t,ω)(1?P(t,ω))P(t,ω), t∈[t₀,T], P(t₀,ω)=P₀(ω), where ω is any outcome in the sample space Ω. In the recent contribution [Cortés, JC, et al. Commun Nonlinear Sci Numer Simulat 2019; 72: 121–138], the authors imposed conditions on the diffusion coefficient A(t) and on the initial condition P₀ to approximate the density function f₁(p,t) of P(t): A(t) is expressed as a Karhunen–Loève expansion with absolutely continuous random coefficients that have certain growth and are independent of the absolutely continuous random variable P₀, and the density of P₀, , is Lipschitz on (0,1). In this article, we tackle the problem in a different manner, by using probability tools that allow the hypotheses to be less restrictive. We only suppose that A(t) is expanded on L²([t₀,T]×Ω), so that we include other expansions such as random power series. We only require absolute continuity for P₀, so that A(t) may be discrete or singular, due to a modified version of the random variable transformation technique. For , only almost everywhere continuity and boundedness on (0,1) are needed. We construct an approximating sequence of density functions in terms of expectations that tends to f₁(p,t) pointwise. Numerical examples illustrate our theoretical results.     

三次Gauss和及二项指数和的混合均值

我们用三角和的性质研究一类三次Gauss和与两项指数和混合均值的计算问题,并给出一个精确的计算公式.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

Existence of homoclinic solutions for nonlinear second-order coupled systems

This work presents sufficient conditions for the existence of homoclinic solutions for second order coupled discontinuous systems of differential equations on the real line without the usual growth condition in the literature.The arguments apply the fixed point theory, Green's functions technique, $L^1$-Carathéodory functions, lower and upper solutions and Schauder's fixed point theorem.     

Approximation of Functions by the Szász-Mirakjan-Kantorovich Operator

We characterize the approximation of functions in the L_p-norm by the Szász-Mirakjan-Kantorovich operator. We prove a direct and a strong converse inequality of type B in terms of an appropriate K-functional.     

一类变号(k,n-k)共轭边值问题正解的存在性

通过构造一个特殊的锥,利用范数形式的锥拉伸锥压缩不动点定理,在允许非线性项变号无下界且没有任何单调性假设的条件下,得出了一类高阶(k,n-k)共轭两点边值问题方程组正解的存在性结论.     

A Bertini type theorem for pencils over finite fields

We study the question of finding smooth hyperplane sections to a pencil of hypersurfaces over finite fields.