渐近正态随机变量函数的极限分布

基于渐近正态随机变量,导出随机变量函数极限分布的两个一般性理论结果.作为应用,证明了渐近正态随机变量一系列具体函数的极限分布,其中包括泊松随机变量平方根的渐近正态性,以及随机变量部分和在正则化常数是随机变量情况下的渐近正态性.     

Asymptotic direction for random walks in random environments

In this paper we study the existence of an asymptotic direction for random walks in random i.i.d. environments (RWRE). We prove that if the set of directions where the walk is transient contains a non-empty open set, the walk admits an asymptotic direction. The main tool to obtain this result is the construction of a renewal structure with cones. We also prove that RWRE admits at most two opposite asymptotic directions.     

Asymptotic autonomous attractors for a stochastic lattice model with random viscosity

We study forward asymptotic autonomy of a pullback random attractor for a non-autonomous random lattice system and establish the criteria in terms of convergence, recurrence, forward-pullback absorption and asymptotic smallness of the discrete random dynamical system. By applying the abstract result to both non-autonomous and autonomous stochastic lattice equations with random viscosity, we show the existence of both pullback and global random attractors such that the time-component of the pullback attractor semi-converges to the global attractor as the time-parameter tends to infinity.     

A note on runs of geometrically distributed random variables

Recently, Grabner et al. [Combinatorics of geometrically distributed random variables: run statistics, Theoret. Comput. Sci. 297 (2003) 261-270] and Louchard and Prodinger [Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis, Theoret. Comput. Sci. 304 (2003) 59-86] considered the run statistics of geometrically distributed independent random variables. They investigated the asymptotic properties of the number of runs and the longest run using the corresponding probability generating functions and a Markov chain approach. In this note, we reconsider the asymptotic properties of such statistics using another approach. Our approach of finding the asymptotic distributions is based on the construction of runs in a sequence of m-dependent random variables. This approach enables us to find the asymptotic distributions of many run statistics via the theorems established for m-dependent sequence of random variables. We also provide the asymptotic distribution of the total number of non-decreasing runs and the longest non-decreasing run.     

随机映射图的连接概率

本文将计算随机映射图的给定顶点集的任意分类的连接概率及其极限性质,导出随机映射图的连通分支个数的分布与渐进分布．     

The continuum random tree is the scaling limit of unlabeled unrooted trees

We show that the uniform unlabeled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov‐Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This confirms a conjecture by Aldous (1991). We also establish Benjamini‐Schramm convergence of this model of random trees and provide a general approximation result, that allows for a transfer of a wide range of asymptotic properties of extremal and additive graph parameters from Pólya trees to unrooted trees.     

Spectra of infinite-dimensional sample covariance matrices

We study spectral functions of infinite-dimensional random Gram matrices of the form RR^T, where R is a rectangular matrix with an infinite number of rows and with the number of columns N → ∞, and the spectral functions of infinite sample covariance matrices calculated for samples of volume N → ∞ under conditions analogous to the Kolmogorov asymptotic conditions. We assume that the traces d of the expectations of these matrices increase with the number N such that the ratio d/N tends to a constant. We find the limiting nonlinear equations relating the spectral functions of random and nonrandom matrices and establish the asymptotic expression for the resolvent of random matrices. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 148, No. 2, pp. 309–322, August, 2006.     

A random walk with a branching system in random environments

We consider a branching random walk in random environments, where the particles are reproduced as a branching process with a random environment (in time), and move independently as a random walk on Z with a random environment (in locations). We obtain the asymptotic properties on the position of the rightmost particle at time n, revealing a phase transition phenomenon of the system.     

A martingale approach to directed polymers in a random environment

The diffusive behavior for a system of directed polymers in a random environment was first rigorously discussed by Imbrie and Spencer, and then by Bolthausen. By means of some basic properties of martingales we extend some results due to Imbrie and Spencer concerning the asymptotic behaviour of the mean square displacement. We also obtain a Wiener process behaviour with probability one for this system. Bolthausen already used some martingale limit theorems to prove a central limit theorem for this system.Partly supported by AvH Foundation.     

关于随机算子若干问题的研究

研究了新的随机不动点指数的计算问题,利用随机不动点指数的理论推广了著名的Amann定理.提出了随机算子的随机渐进歧点的新概念,并且研究了随机k(ω)-集压缩算子的随机渐进歧点的一些问题,也得到了若干新的结果.     

Twin peaks

We study random labelings of graphs conditioned on a small number (typically one or two) peaks, that is, local maxima. We show that the boundaries of level sets of a random labeling of a square with a single peak have dimension 2, in a suitable asymptotic sense. The gradient line of a random labeling of a long ladder graph conditioned on a single peak consists mostly of straight line segments. We show that for some tree‐graphs, if a random labeling is conditioned on exactly two peaks then the peaks can be very close to each other. We also study random labelings of regular trees conditioned on having exactly two peaks. Our results suggest that the top peak is likely to be at the root and the second peak is equally likely, more or less, to be any vertex not adjacent to the root.     

Products of Random Rectangular Matrices

We study the asymptotic behaviour of points under matrix cocyles generated by rectangular matrices. In particular we prove a random Perron‐Frobenius and a Multiplicative Ergodic Theorem. We also provide an example where such products of random rectangular matrices arise in the theory of random walks in random environments and where the Multiplicative Ergodic Theorem can be used to investigate recurrence problems.     

Asymptotic normality in random graphs with given vertex degrees

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model and then, by a conditioning argument, for the simple uniform random graph with the given degree sequence. Such conditioning is standard for convergence in probability, but much less straightforward for convergence in distribution as here. The proof uses the method of moments, and is based on a new estimate of mixed cumulants in a case of weakly dependent variables. The result on small components is applied to give a new proof of a recent result by Barbour and Röllin on asymptotic normality of the size of the giant component in the random multigraph; moreover, we extend this to the random simple graph.     

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one‐dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

一类非自治分数阶随机波动方程的随机吸引子

本文考虑带加性噪声的非自治分数阶随机波动方程在无界区域R~n上的渐近行为.首先将随机偏微分方程转化为随机方程,其解产生一个随机动力系统,然后运用分解技术建立该系统的渐近紧性,最后证明随机吸引子的存在性.     

Precise large deviations for generalized dependent compound renewal risk model with consistent variation

We investigate the precise large deviations of random sums of negatively dependent random variables with consistently varying tails. We find out the asymptotic behavior of precise large deviations of random sums is insensitive to the negative dependence. We also consider the generalized dependent compound renewal risk model with consistent variation, which including premium process and claim process, and obtain the asymptotic behavior of the tail probabilities of the claim surplus process.     

Two-Stage Nested Partitions Method for Stochastic Optimization

We address the problem of optimizing over a large but finite set when the objective function does not have an analytical expression and is evaluated using noisy estimation. Building on the recently proposed nested partitions method for stochastic optimization, we develop a new approach that combines this random search method and statistical selection for guiding the search. We prove asymptotic convergence and analyze the finite time behavior of the new approach. We also report extensive numerical results to illustrate the benefits of the new approach.     

广义风险过程中渐近方差的非参数估计

本文对广义风险过程中的渐近方差作了非参数估计,得出并证明了两个定理,为广义风险过程中破产概率的区间估计作了理论准备．     

Asymptotics of the Moment Generating Function for the Range of Random Walks

The range of random walks means the number of distinct sites visited at least once by the random walk before time n. We are interested in the free energy function of the range of simple symmetric random walks and determine the asymptotic behavior near the origin.