CENTRAL LIMIT THEOREMS FOR A BRANCHING RANDOM WALK WITH A RANDOM ENVIRONMENT IN TIME

We consider a branching random walk with a random environment m time, in which the offspring distribution of a particle of generation n and the distribution of the displacements of its children depend on an environment indexed by the time n. The envi- ronment is supposed to be independent and identically distributed. For A C R, let Zn（A） be the number of particles of generation n located in A. We show central limit theorems for the counting measure Zn （-） with appropriate normalization.

RENEWAL THEOREM FOR(L,1)-RANDOM WALK IN RANDOM ENVIRONMENT

We consider a random walk on Z in random environment with possible jumps {-L,…, -1, 1}, in the case that the environment {ωi ： i ∈ Z} are i.i.d.. We establish the renewal theorem for the Markov chain of ＂the environment viewed from the particle＂ in both annealed probability and quenched probability, which generalize partially the results of Kesten （1977） and Lalley （1986） for the nearest random walk in random environment on Z, respectively. Our method is based on （L, 1）-RWRE formulated in Hong and Wang the intrinsic branching structure within the （2013）.

LIMIT THEOREMS FOR A GALTON-WATSON PROCESS IN THE I.I.D. RANDOM ENVIRONMENT

In this article, we obtain the central limit theorem and the law of the iterated logarithm for Galton-Watson processes in i.i.d, random environments.

A NOTE ON EXACT CONVERGENCE RATE IN THE LOCAL LIMIT THEOREM FOR A LATTICE BRANCHING RANDOM WALK

Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Zn（z） the number of particles in the n-th generation in the model for each z ∈ Z. We derive the exact convergence rate in the local limit theorem for Zn（z） assuming a condition like ＂EN（logN）1＋λ 〈 ∞＂ for the offspring distribution and a finite moment condition on the motion law. This complements the known results for the strongly non-lattice branching random walk on the real line and for the simple symmetric branching random walk on the integer lattice.

SOME SMALL DEVIATION THEOREMS FOR ARBITRARY CONTINUOUS RANDOM SEQUENCE

Let （Xn）n∈EN be a sequence of arbitrary continuous random variables, by the notion of relative entropy hμ^μ（w） as a measure of dissimilarity between probability measure # and reference measure μ, the explicit, general bounds for the partial sums of arbitrary continuous random variables under suitable conditions are developed. The argument uses the known and elementary lcmma of convergence for likelihood ratio.

CENTRAL LIMIT THEOREM AND CONVERGENCE RATES FOR A SUPERCRITICAL BRANCHING PROCESS WITH IMMIGRATION IN A RANDOM ENVIRONMENT

We are interested in the convergence rates of the submartingale Wn=Z_(n)/Π_(n)to its limit W,where(Π_(n))is the usually used norming sequence and(Z_(n))is a supercritical branching process with immigration(Y_(n))in a stationary and ergodic environmentξ.Under suitable conditions,we establish the following central limit theorems and results about the rates of convergence in probability or in law:(i)W-W_(n) with suitable normalization converges to the normal law N(0,1),and similar results also hold for W_(n+k)-W_(n) for each fixed k∈N^(*);(ii)for a branching process with immigration in a finite state random environment,if W_(1) has a finite exponential moment,then so does W,and the decay rate of P(|W-W_(n)|>ε)is supergeometric;(iii)there are normalizing constants an(ξ)(that we calculate explicitly)such that a_(n)(ξ)(W-W_(n))converges in law to a mixture of the Gaussian law.

QUANTITATIVE THEOREM AND SATURATION THEOREM FOR MULTIVARIATE RANDOMFUNCTIONS

In this paper, we give the quantitative theorem and saturation theorem for random functions with compact convex parameter spaces.

A THEOREM ON THE CONVERGENCE OF SUMS OF INDEPENDENT RANDOM VARIABLES

Let Sigma (infinity)(n=1) X-n be a series of independent random variables with at least one non-degenerate X-n, and let F-n be the distribution function of its partial sums S-n = Sigma (n)(k=1) X-k. Motivated by Hildebrand's work in [1], the authors investigate the a.s. convergence of Sigma (infinity)(n=1) X-n under a hypothesis that Sigma (infinity)(n=1) rho (X-n, c(n)) = infinity whener Sigma (infinity)(n=1) c(n) diverges, where the notation rho (X,c) denotes the Levy distance between the random variable X and the constant c. The principal result of this paper shows that the hypothesis is the condition under which the convergence of F-n(x(0)) with the limit value 0 < L-0 < 1, together with the essential convergence of Sigma (infinity)(n=1) X-n, is both sufficient and necessary in order for the series Sigma (infinity)(n=1) X-n to a.s. coverage. Moreover, if the essential convergence of Sigma (infinity)(n=1) X-n is strengthened to limsup(n=infinity) P(\S-n\ < K) = 1 for some K > 0, the hypothesis is already equivalent to the a.s. convergence of Sigma (infinity)(n=1) X-n. Here they have not only founded a very general limit theorem, but improved the related result in Hildebrand([1]) as well.

Limit Theorems for a Storage Process with a Random Release Rule

We consider a discrete time Storage Process Xn with a simple random walk input Sn and a random release rule given by a family {Ux, x ≥ 0} of random variables whose probability laws {Ux, x ≥ 0} form a convolution semigroup of measures, that is, μx × μy = μx + y The process Xn obeys the equation: X0 = 0, U0 = 0, Xn = Sn - USn, n ≥ 1. Under mild assumptions, we prove that the processes and are simple random walks and derive a SLLN and a CLT for each of them.

KAM Type-Theorem for Lower Dimensional Tori in Random Hamiltonian Systems

In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small perturbation. Using this result, we can describe the stability of the non-autonomous dynamic systems.

Biased Random Number Generator Based on Bell's Theorem

We propose a biased random number generation protocol whose randomness is based on the violation of the Clauser Home inequality. Non-maximally entangled state is used to maximize the Bell violation. Due to the rotational asymmetry of the quantum state, the ratio of Os to ls varies with the measurement bases. The experimental partners can then use their measurement outcomes to generate the biased random bit string. The bias of their bit string can be adjusted by altering their choices of measurement bases. When this protocol is implemented in a device-independent way, we show that the bias of the bit string can still be ensured under the collective attack.

Some Strong Deviation Theorems for Dependent Continuous Random Sequence

Let {Xn,n ≥ 1} be a sequence of arbitrary continuous random variables,we introduce the notion of limit asymptotic logarithm likelihood ratio r（ω）,as a measure of dissimilarity between probability measure P and reference measure Q.We get some strong deviation theorems for the partial sums of arbitrary continuous random variables under Chung-Teicher＇s type conditions[6-7].

Traversable Wormholes and the Brouwer Fixed-Point Theorem

The Brouwer fixed-point theorem in topology states that for any continuous mapping f on a compact convex set into itself admits a fixed point, i.e., a point x0 such that f(x0) = x0. Under suitable conditions, this fixed point corresponds to the throat of a traversable wormhole, i.e., b(r0) = r0 for the shape function b = b(r). The possible existence of wormholes can therefore be deduced from purely mathematical considerations without going beyond the existing physical requirements.

THE EXTENSION THEOREM OF LINEAR RANDOM FUNCTIONALS AND ITS APPLICATIONS

ＴＨＥＥＸＴＥＮＳＩＯＮＴＨＥＯＲＥＭＯＦＬＩＮＥＡＲＲＡＮＤＯＭＦＵＮＣＴＩＯＮＡＬＳＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＳ￥ＬｉｎＸｉ；ＬｉＣｈｕａｎｍｕ（ＪｉｍｅｉＮａｖｉｇａｔｉｏｎＩｎｓｔｉｔｕｔｅＸｉ＇ａｎＪｉａｏｔｏｎｇＵｎｉｖｅｒｓｉｔ...

基于中国剩余定理的NFC安全认证算法

针对近场通信技术在应用中出现的安全隐患问题,给出一种基于中国剩余定理的算法。算法利用中国剩余定理实现对传送信息进行加密,中国剩余定理基于数学中大素数分解难题,使得攻击者无法进行破解;所有信息加密过程中混入随机数,用于保证消息的新鲜性;算法在进行信息更新时采用伪随机函数计算,因伪随机函数具备的单向性,使得攻击者无法分析出有用隐私信息。将不同算法对比安全分析,表明该算法能够抵抗重放攻击、异步攻击等多种攻击。通过性能角度及仿真实验对多个算法进行分析,结果表明该算法计算时间复杂度低于其他算法。

基于最大后验估计的编码孔图像重建算法

图像重建算法对编码孔伽马相机的成像性能有重要的影响,然而广泛使用的最大似然期望最大化(MLEM)算法无法在较强干扰背景下有效抑制图像中的噪声,当超过一定迭代次数后,图像信噪比会逐渐降低。针对MLEM算法的这一“病态性”问题开展了研究。首先将最大后验估计(MAP)算法应用于编码孔图像重建,接着分析了算法中Gibbs先验函数的邻域大小和权值系数等关键参数的选取方法。然后使用编码孔相机开展了成像实验,对比了MLEM算法与MAP算法对22Na点源的图像重建结果。结果表明,在300~1 200次迭代下,MLEM重建图像中出现了明显的噪点,且随着迭代深入图像质量逐渐变差;而MAP重建图像没有出现明显噪点,重建图像的平均梯度相较于MLEM降低了26.45%~49.16%,对比度噪声比(CNR)提升了42.32%~351.07%。另外,对比了3×3和5×5邻域大小时的多点源图像重建结果,结果显示,邻域过小会导致重建图像的热点亮度降低,与理论分析结果一致。最后,分别对比了MLEM与MAP算法在较远距离和较强干扰两种场景下的成像结果,MAP算法均表现出更好的信噪比性能。

随机振动加速度响应谱及与冲击等效性分析

目的 获得随机振动的加速度响应谱,提升随机振动与冲击的等效性分析精度。方法 首先,基于维纳-辛钦定理,推导单自由度系统在随机振动基础激励作用下加速度响应均方值的通用表达式;其次,分别推导单自由度系统在理想白噪声和限带非均匀谱随机振动基础激励作用下的加速度响应均方值;再次,基于3σ准则,推导限带非均匀谱随机振动的3σ加速度响应谱;最后,基于加速度响应等效,通过将装备随机振动条件的3σ加速度响应谱与冲击条件的冲击响应谱进行等效性分析,对GJB 150.18A—2009中的冲击试验剪裁条件进行精细优化。结果 精细优化后,可有效改善冲击试验剪裁条件的工程实施精度。结论 获得了限带非均匀谱随机振动的3σ加速度响应谱,并基于此对GJB 150.18A—2009中的冲击试验剪裁条件进行了精细优化,对于装备合理剪裁冲击试验具有借鉴意义。

适用于现场总线的无证书聚合签名方案

针对现场总线缺乏身份认证以及设备计算资源和网络带宽受限的缺点,提出一种适用于现场总线网络的无证书聚合签名方案,避免复杂的证书管理和密钥管理,在注册阶段使用中国剩余定理,提高假名分发的效率。在安全性证明部分,利用分叉引理对所提签名方案的不可伪造性进行证明。效率方面,签名生成和签名验证阶段避免计算量较大的双线性对运算,支持聚合签名,实现对签名的批量认证,适用于对实时性要求较高且计算资源受限的现场总线网络。实验结果表明,该方案相比于其它方案,计算开销和通信开销有显著降低。

Precise Asymptotics in Limit Theorems for a Supercritical Branching Process with Immigration in a Random Environment

Let(Zn)be a supercritical branching process with immigration in an independent and identically distributed random environment.Under necessary moment conditions,we show the exact convergence rate in the central limit theorem on log Zn and establish the corresponding local limit theorem by using the moments of the natural submartingale and the convergence rates of its logarithm.By similar approach and with the help of a change of measure,we also present the so-called integrolocal theorem and integral large deviation theorem to characterize the precise asymptotics of the upper large deviations.

局部平均随机过程随机场采样定理

随机信号采样定理的相关研究几十年来一直是采样定理主流方向之一,在理论和实际应用两方面都受到信息领域和数学领域的广泛关注。近年来,采样理论在随机过程和随机场的局部平均采样方面得出了一系列研究成果。首先,分析了采样定理在应用中的缺陷和局限性。其次,对近几年在随机过程、高维随机过程、随机场、时空随机场局部平均采样定理方面的发展和相关结论做了系统介绍。最后,对基于混合范数的时空随机场采样逼近、采样形式、信号形式、范数形式等问题进行了展望。结果表明:局部平均的采样方式提高了采样的精度和逼近效果,随机场局部平均采样理论在海浪参数反演和海洋污染监测方面有重要应用。特别是基于混合范数的时空随机场采样理论的研究不仅具有重要的理论价值,而且对于工程领域也有应用价值。