父代种群参与竞争遗传算法几乎必然收敛

熟知,标准遗传算法如不采用“杰出者记录策略”则必不收敛。本文发现：允许父代种群参与竞争是标准遗传算法几乎必然收敛的条件。特别地,我们运用鞅收敛定理证明：允许父代种群参与竞争型遗传算法能以概率1确保在限步内达到全局最优解,且收敛与种群规模无关。所获结果对该类遗传算法的应用奠定了可靠基础。     

An asymptotic relationship for ruin probabilities under heavy-tailed claims

The famous Embrechts-Goldie-Veraverbeke formula shows that, in the classical Cramér-Lundberg risk model, the ruin probabilities satisfy \(R(x, \infty ) \sim \rho ^{ - 1} \bar F_e (x)\) if the claim sizes are heavy-tailed, where F_e denotes the equilibrium distribution of the common d.f. F of the i.i.d. claims, ? is the safety loading coefficient of the model and the limit process is for x → ∞. In this paper we obtain a related local asymptotic relationship for the ruin probabilities. In doing this we establish two lemmas regarding the n-fold convolution of subexponential equilibrium distributions, which are of significance on their own right.     

The connectivity of a graph on uniform points on [0,1]

A random graph G_n(x) is constructed on independent random points U₁,…,U_n distributed uniformly on [0,1]^d, d1, in which two distinct such points are joined by an edge if the l_∞-distance between them is at most some prescribed value 0<x<1. The connectivity distance c_n, the smallest x for which G_n(x) is connected, is shown to satisfy

(1)

For d2, the random graph G_n(x) behaves like a d-dimensional version of the random graphs of Erdös and Rényi, despite the fact that its edges are not independent: c_n/d_n→1, a.s., as n→∞, where d_n is the largest nearest-neighbor link, the smallest x for which G_n(x) has no isolated vertices.     

Aggregation/Disaggregation Iterative Methods Applied to Leontev Systems and Markov Chains

The paper surveys some recent results on iterative aggregation/disaggregation methods (IAD) for computing stationary probability vectors of stochastic matrices and solutions of Leontev linear systems. A particular attention is paid to fast IAD methods.     

Exact Misclassification Probabilities for Plug-In Normal Quadratic Discriminant Functions: II. The Heterogeneous Case

We consider the problem of discriminating between two independent multivariate normal populations, N_p(μ₁, Σ₁) and N_p(μ₂, Σ₂), having distinct mean vectors μ₁ and μ₂ and distinct covariance matrices Σ₁ and Σ₂. The parameters μ₁, μ₂, Σ₁, and Σ₂ are unknown and are estimated by means of independent random training samples from each population. We derive a stochastic representation for the exact distribution of the “plug-in” quadratic discriminant function for classifying a new observation between the two populations. The stochastic representation involves only the classical standard normal, chi-square, and F distributions and is easily implemented for simulation purposes. Using Monte Carlo simulation of the stochastic representation we provide applications to the estimation of misclassification probabilities for the well-known iris data studied by Fisher (Ann. Eugen.7 (1936), 179–188); a data set on corporate financial ratios provided by Johnson and Wichern (Applied Multivariate Statistical Analysis, 4th ed., Prentice–Hall, Englewood Cliffs, NJ, 1998); and a data set analyzed by Reaven and Miller (Diabetologia16 (1979), 17–24) in a classification of diabetic status.     

On the Distribution of the Sum of n Non-Identically Distributed Uniform Random Variables

The distribution of the sum of independent identically distributed uniform random variables is well-known. However, it is sometimes necessary to analyze data which have been drawn from different uniform distributions. By inverting the characteristic function, we derive explicit formulae for the distribution of the sum of n non-identically distributed uniform random variables in both the continuous and the discrete case. The results, though involved, have a certain elegance. As examples, we derive from our general formulae some special cases which have appeared in the literature.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

On the covariance of the level sizes in random recursive trees

In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, l and tree sizes N. The fraction of nodes k steps away from the root is a random probability distribution in k. The expression for the covariances allows us to show that the total variation distance between this (random) probability distribution and its mean converges in probability to zero. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 519–539, 2002     

���帺������β��������ͼ������ֵβ���ʵĽ�����

Let $X_1,X_2,\ldots,X_n$ be a sequence of extended negatively dependent random variables with distributions $F_1,F_2,\ldots,F_n$,respectively. Denote by $S_n=X_1+X_2+\cdots+X_n$. This paper establishes the asymptotic relationship for the quantities $\pr(S_n>x)$, $\pr(\max\{X_1,X_2, \ldots,X_n\}>x)$, $\pr(\max\{S_1,S_2$, $\ldots,S_n\}>x)$ and $\tsm_{k=1}^n\pr(X_k>x)$ in the three heavy-tailed cases. Based on this, this paper also investigates the asymptotics for the tail probability of the maximum of randomly weighted sums, and checks its accuracy via Monte Carlo simulations. Finally, as an application to the discrete-time risk model with insurance and financial risks, the asymptotic estimate for the finite-time ruin probability is derived.     

The survival probability of critical and subcritical branching processes in finite state space Markovian environment

Let ${\left(Z_n\right)}_{n\ge 0}$ be a branching process in a random environment defined by a Markov chain ${\left(X_n\right)}_{n\ge 0}$ with values in a finite state space $\mathbb{X}$. Let ${\mathbb{P}}_i$ be the probability law generated by the trajectories of ${\left(X_n\right)}_{n\ge 0}$ starting at $X_0=i\in \mathbb{X}.$ We study the asymptotic behaviour of the joint survival probability ${\mathbb{P}}_i\left(Z_n>0,X_n=j\right)$, $j\in \mathbb{X}$ as $n\to +\infty$ in the critical and strongly, intermediate and weakly subcritical cases.