Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

局部分数阶拉普拉斯算子的狄利克雷问题弱解的细正则性

In this paper, we study the Holder regularity of weak solutions to the Dirichlet problem associated with the regional fractional Laplacian (-△)^αΩ on a bounded open set Ω ■R(N ≥ 2) with C^(1,1) boundary ■Ω. We prove that when f ∈ L^p(Ω), and g ∈ C(Ω), the following problem (-△)^αΩu = f in Ω, u = g on ■Ω, admits a unique weak solution u ∈ W^(α,2)(Ω) ∩ C(Ω),where p >N/2-2α and 1/2< α < 1. To solve this problem, we consider it into two special cases, i.e.,g ≡ 0 on ■Ω and f ≡ 0 in Ω. Finally, taking into account the preceding two cases, the general conclusion is drawn.     

The value function of a transportation problem

We investigate the value of an optimal transportation problem with the maximization objective as a function of costs and vectors of production and consumption. The value is concave in production. For generic costs, the numbers of linearity domains and peak points are independent of costs and consumption. The peak points are determined by an auxiliary assignment problem. The volumes of the linearity domains are independent of costs while their dependence on consumption can be expressed via the multinomial distribution.     

粗糙表面之间接触热阻反问题研究

当两个固体表面相互接触时,由于接触面粗糙度的影响,界面间就形成了非一致接触,这种接触导致热流收缩,进而产生接触热阻. 目前的理论研究主要集中在正问题研究,对反问题的研究相对较少. 接触热阻反问题研究是通过研究部分边界温度、热流和部分测量点的温度来反演得到界面上的接触热阻. 反问题研究在很多工程领域都有应用,如航空航天、机械制造、微电子等,是工程中确定接触热阻一种快速有效的方法. 本文采用边界元法和共轭梯度法研究了二维空间随坐标变化的接触热阻反问题. 为了验证方法的准确性和可行性,假定在已知部分测量点温度和真实接触热阻的情况下,反演计算得到界面的温度和热流,进而得到接触热阻,并与真实接触热阻进行比较. 结果表明采用边界元法和共轭梯度法在无测量误差的情况下,可以准确反演获得界面的真实接触热阻. 若存在测量误差,反演计算结果对测量误差极其敏感,反演结果误差会由于测量误差的引入而被放大. 为处理这种不适定性, 采用最小二乘法对反演计算结果进行校正,结果表明采用最小二乘法能够避开反问题中一些偏离实际值较大的测量点,显著提高反演计算结果的准确性.      

Stability in the Erdős–Gallai Theorem on cycles and paths,II

The Erd?s–Gallai Theorem states that for $k\ge 3$, any $n$-vertex graph with no cycle of length at least $k$ has at most $\frac{1}{2}(k?1)(n?1)$ edges. A stronger version of the Erd?s–Gallai Theorem was given by Kopylov: If $G$ is a 2-connected $n$-vertex graph with no cycle of length at least $k$, then $e\left(G\right)\le max\{h(n,k,2),h(n,k,?\frac{k?1}{2}?)\}$, where $h(n,k,a)?\left(\genfrac{}{}{0ex}{}{k?a}{2}\right)+a(n?k+a)$. Furthermore, Kopylov presented the two possible extremal graphs, one with $h(n,k,2)$ edges and one with $h(n,k,?\frac{k?1}{2}?)$ edges.In this paper, we complete a stability theorem which strengthens Kopylov’s result. In particular, we show that for $k\ge 3$ odd and all $n\ge k$, every $n$-vertex 2-connected graph $G$ with no cycle of length at least $k$ is a subgraph of one of the two extremal graphs or $e\left(G\right)\le max\{h(n,k,3),h(n,k,\frac{k?3}{2})\}$. The upper bound for $e\left(G\right)$ here is tight.     

The GLM representation of the two-component nonlinear Schrödinger equation on the half-line

The Gelfand-Levitan-Marchenko representation is used to analyze the initialboundary value problem of two-component nonlinear Schr¨odinger equation on the half-line.It has shown that the global relation can be effectively analyzed by the Gelfand-LevitanMarchenko representation. we also derive expressions for the Dirichlet-to-Neumann map to characterize the unknown boundary values.