Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces

We establish quantitative concentration estimates for the empirical measure of many independent variables, in transportation distances. As an application, we provide some error bounds for particle simulations in a model mean field problem. The tools include coupling arguments, as well as regularity and moment estimates for solutions of certain diffusive partial differential equations.     

Some Invariance Principles for Random Vectors in the Generalized Domain of Attraction of the Multivariate Normal Law

For independent identically distributed random vectors belonging to the generalized Domain of Attraction of the multivariate normal law, we define two partial sum processes analogous to that of Donsker's Theorem. We prove that each converges in distribution to a Brownian Motion in the space of continuous functions. One process uses nonrandom operator normalization, and the other is a studentization of the first, using normalization by the empirical covariance operator.     

模糊值Choquet积分(Ⅱ)--函数关于模糊值模糊测度的Choquet积分

研究一种取值于模糊数集的Choquet积分，该积分的被积函数是单值函数，所用的测度是模糊值模糊测度。给出其定义、性质和收敛定理。     

MILO中场不稳定性的非线性发展及混沌行为

 以磁绝缘传输线振荡器中电子运动和辐射场演化方程为基础，分析了场与电子相互作用过程中的不稳定性。这种不稳定性的发展导致场出现极限环振荡和混沌。在软非线性区域，辐射场表现为不连续的极限环振荡；在硬非线性区域，辐射场表现为连续的混沌行为。控制失谐量可加速或抑制这些不稳定态的出现。优化和调节参数可控制器件的运行状态, 获得较高的输出功率。     

Convex central configurations for the n-body problem

We give a simple proof of a classical result of MacMillan and Bartky (Trans. Amer. Math. Soc. 34 (1932) 838) which states that, for any four positive masses and any assigned order, there is a convex planar central configuration. Moreover, we show that the central configurations we find correspond to local minima of the potential function with fixed moment of inertia. This allows us to show that there are at least six local minimum central configurations for the planar four-body problem. We also show that for any assigned order of five masses, there is at least one convex spatial central configuration of local minimum type. Our method also applies to some other cases.     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

两类记录值之和的中心极限定理

该文给出了Ｌｏｇｉｓｔｉｃ分布纪录值序列部分和的中心极限定理；对于Ｐａｒｅｔｏ分布纪录值序列的部分和T_n，获得了ｌｎT_n的中心极限定理．这一工作不仅具有概率论的极限理论方面的研究价值，而且在金融、保险等领域也具有相当重要的应用前景．     

On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems

We consider a discrete-time stochastic model of an ECN/RED gateway where competing TCP sources share the link capacity. As the number of competing flows becomes large, the asymptotic queue behavior (normalized by the number of flows) at the gateway can be described by a simple recursion and the throughput behavior of individual TCP flows becomes asymptotically independent. A Central Limit Theorem complement is also presented, yielding a more accurate characterization of the asymptotic queue size. These results suggest a scalable yet accurate model of this complex large-scale stochastic feedback system, and crisply reveal the sources of queue fluctuations. This work was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. This work was also supported by the Space and Naval Warfare Systems Center—San Diego under Contract No: N66001-00-C-8063. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government.     

关于Menger图的几种运算

设Ｇ是一个简单连通图，若分离Ｇ的余一独立集Ｓ的最小点数等于连接Ｓ的点之间的内部不相交路的最大个数，则称Ｇ是Ｍｅｎｇｅｒ图。我们考虑了图的几种运算并给出了运算后的图是Ｍｅｎｇｅｒ图的条件。     

A remark on Mansfield's imprimitivity theorem

We show that the Morita equivalence part of Mansfield's Imprimitivity Theory can be obtained by Green's Imprimitivity Theorem (and duality theory).