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].     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

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.     

Hjelmslev quadrilateral central configurations

A Hjelmslev quadrilateral is a quadrilateral with two right angles at opposite vertices. Using mutual distances as coordinates, we show that any four-body central configuration forming a Hjelmslev quadrilateral must be a right kite configuration.     

Na原子链表面等离激元特性的含时密度泛函研究

本文用含时密度泛函理论研究了线性Na原子链的表面等离激元机理.主要在原子尺度下模拟计算了体系随着原子数增加及原子间距变化的集体激发过程.研究发现线性原子链有一个普遍的特性——存在一个纵模和两个横模.两个横模一般在实验上很难被观测到.纵模随着原子链长度增加,能量红移的同时,该纵模主峰的强度呈线性增长.随着原子个数的增加,端点模式(TE)开始蓝移,能量和偶极强度都逐渐趋向饱和.横模能量被劈裂的原因概括如下:(一)每个位置的电子受到的势不同,在两端的电子受到的势要比在中间的电子受到的势要高,因此两端的电荷积累也比中间多;(二)端点存在悬挂键,所以中间的电子-电子间相互作用与端点的不一样,这两方面又都与原子间距d有关.     

Solvent terminated natural deep eutectic solvent microextraction for concentration of curcuminoids in Curcumae Longae Rhizoma and turmeric tea

A novel solvent terminated microextraction method based on a natural deep eutectic solvent (L-menthol and lactic acid at a molar ratio of 1:2) coupled with high-performance liquid chromatography was proposed, which was utilized for the separation and enrichment of bisdemethoxycurcumin, demethoxycurcumin and curcumin in Curcumae Longae Rhizoma and turmeric tea. The effects of independent parameters on extraction efficiency were optimized by single-factor analysis. Subsequently, four predominated parameters affecting the extraction procedure, including extractant volume, salt concentration, demulsifier consumption, and demulsification time, were further evaluated by a central composite design. Under the optimized conditions, the linear ranges of calibration curves were 0.005–0.5 μg/mL for bisdemethoxycurcumin, 0.004–0.4 μg/mL for demethoxycurcumin, and 0.0045–0.45 μg/mL for curcumin, respectively. In addition, the developed method provided low detection limits (0.1–0.4 ng/mL) and high enrichment factors (279–350). Its intra-day and inter-day precision were carried out by relative standard deviation ranging from 2.2 to 9.2%. Finally, the applicability of this method was assessed by the analysis of Curcumae Longae Rhizoma and turmeric tea samples. The results showed that these samples were detected successfully and the spiked recoveries over the range of 85.3-108.9% with relative standard deviations of 1.6-8.9% were attained, indicating its high relative recoveries with good precision in real sample analysis.     

经典N=2李共形超代数的导子和第二上同调群

研究了经典N=2李共形超代数的导子和第二上同调群的结构,并应用第二上同调群的结果确定了该李共形超代数的泛中心扩张.     

Structures of the twisted N = 1 Schrödinger–Neveu–Schwarz algebra

In this paper, we determine the universal central extension, derivation algebra and automorphism group of the twisted N = 1 Schrödinger–Neveu–Schwarz algebra. Furthermore, we generalize these results to the generalized twisted N = 1 Schrödinger–Neveu–Schwarz algebra in the final section.     

On martingale tail sums for the path length in random trees

For a martingale (X_n) converging almost surely to a random variable X, the sequence (X_n– X) is called martingale tail sum. Recently, Neininger (Random Structures Algorithms 46 (2015), 346–361) proved a central limit theorem for the martingale tail sum of Régnier's martingale for the path length in random binary search trees. Grübel and Kabluchko (in press) gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the law of the iterated logarithm for a family of trees containing binary search trees, recursive trees and plane‐oriented recursive trees. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 493–508, 2017