Q-正则Loewner空间中的拟对称映射

本文在Q-正则Loewner空间中用环模不等式刻划了拟对称映射.另外,在 Q-维Ahlfors-David正则空间中建立了拟对称映射作用下的Grotzsch-Teichmuller型 模不等式,它是通过伸张系数的积分平均来表示.     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

-混合序列的不变原理

给出一类较广泛的ρ-混合序列 ,并证明了在一定的矩条件下 ,ρ-混合序列的不变原理成立     

半直线上随机环境中的随机游动的常返性

本文讨论半直线上随机环境中的随机游动的常返性。在独立环境下，主要通过强大数定律，找到了非常返和正常返的一个充分条件下，并将这一结果推广到一些特殊情情形。在一般的随机环境下，主要通过数列的有界性，给出了常返与零常返的一个充分条件。     

Estimates for the Rapid Decay of Concentration Functions of n-Fold Convolutions

We estimate the concentration functions of n-fold convolutions of one-dimensional probability measures. The Kolmogorov–Rogozin inequality implies that for nondegenerate distributions these functions decrease at least as O(n ^–1/2). On the other hand, Esseen⁽³⁾ has shown that this rate is o(n ^–1/2) iff the distribution has an infinite second moment. This statement was sharpened by Morozova.⁽⁹⁾ Theorem 1 of this paper provides an improvement of Morozova's result. Moreover, we present more general estimates which imply the rates o(n ^–1/2).     

Analysis of nonlinear sliding structures by modified stochastic linearization methods

Probabilistic characteristics of a sliding structure is investigated by using new versions of stochastic linearization technique. The structure is composed of base part and upper part, which are connected to each other in a spring-damping system. Coulomb friction between the base structure and earth ground is considered. Two alternative versions of stochastic linearization approach, suggested by X. Zhang and I. Elishakoff, respectively, are applied to such a sliding structure to evaluate its statistical properties. Compared with the results of Monte Carlo simulation, the two new approaches are performing much better than the conventional one in their applications to the sliding structure. Moreover, numerical results indicate that the criterion proposed by Elishakoff turns out to be superior to all other versions in the problem under study. Numerical results also suggest that the entire structure may be replaced by the rigid body in the sliding problem as long as the difference of velocity responses are considered less important than those of displacement responses.     

The characteristic of noncompact convexity and random fixed point theorem for set-valued operators

Let (Ω, Σ) be a measurable space, X a Banach space whose characteristic of noncompact convexity is less than 1, C a bounded closed convex subset of X, KC(C) the family of all compact convex subsets of C. We prove that a set-valued nonexpansive mapping T: C → KC(C) has a fixed point. Furthermore, if X is separable then we also prove that a set-valued nonexpansive operator T: Ω × C → KC(C) has a random fixed point.     

Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

The kink of cellular automaton rule 18 performs a random walk

We give an exact characterization of the movement of a single kink in the elementary cellular automaton Rule 18. It is a random walk with independent increments as well as independent delay times. Its statistical parameters are computed to confirm the earlier simulation results by Grassberger.     

Uniform random number generation

In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject.