On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

Canonical measures on the moduli spaces of compact Riemann surfaces

We study some explicit relations between the canonical line bundle and the Hodge bundle over moduli spaces for low genus. This leads to a natural measure on the moduli space of every genus which is related to the Siegel symplectic metric on Siegel upper half-space as well as to the Hodge metric on the Hodge bundle.     

Gibbs Measures for Brownian Paths Under the Effect of an External and a Small Pair Potential

We consider Brownian motion in the presence of an external and a weakly coupled pair interaction potential and show that its stationary measure is a Gibbs measure. Uniqueness of the Gibbs measure for two cases is shown. Also the typical path behaviour, the degree of mixing and some further properties are derived. We use cluster expansion in the small coupling parameter.     

Variations on the theme of slacks-based measure of efficiency in DEA

In DEA, there are typically two schemes for measuring efficiency of DMUs; radial and non-radial. Radial models assume proportional change of inputs/outputs and usually remaining slacks are not directly accounted for inefficiency. On the other hand, non-radial models deal with slacks of each input/output individually and independently, and integrate them into an efficiency measure, called slacks-based measure (SBM). In this paper, we point out shortcomings of the SBM and propose four variants of the SBM model. The original SBM model evaluates efficiency of DMUs referring to the furthest frontier point within a range. This results in the hardest score for the objective DMU and the projection may go to a remote point on the efficient frontier which may be inappropriate as the reference. In an effort to overcome this shortcoming, we first investigate frontier (facet) structure of the production possibility set. Then we propose Variation I that evaluates each DMU by the nearest point on the same frontier as the SBM found. However, there exist other potential facets for evaluating DMUs. Therefore we propose Variation II that evaluates each DMU from all facets. We then employ clustering methods to classify DMUs into several groups, and apply Variation II within each cluster. This Variation III gives more reasonable efficiency scores with less effort. Lastly we propose a random search method (Variation IV) for reducing the burden of enumeration of facets. The results are approximate but practical in usage.     

随机脉冲泛函微分方程的{\boldmath p}阶矩有界性

随机脉冲泛函微分方程是一个具有广泛应用前景的数学模型. 该文利用带Razumikhin条件的Liapunov直接法和比较原理, 得到了随机脉冲泛函微分方程的解的一致(一致且最终、一致且一致最终) p阶矩有界的充分条件, 其中在获得一致有界性和一致最终有界性时, 对dV(t, x(t))/dt 的限制条件也较少, 因此研究结果非常便于应用.     

随机矩阵乘积的尾概率

在一定条件下,本文给出了一列正随机矩阵乘积的尾概率估计,它以指数的速度消失;然后,在一维的情形,基于更新过程的残差等待时间的拉普拉斯变换,建立了极限常数的两种不同形式表达式之间的联系.     

A Taylor expansion approach for solving partial differential equations with random Neumann boundary conditions

Nonlinear partial differential equation with random Neumann boundary conditions are considered. A stochastic Taylor expansion method is derived to simulate these stochastic systems numerically. As examples, a nonlinear parabolic equation (the real Ginzburg-Landau equation) and a nonlinear hyperbolic equation (the sine-Gordon equation) with random Neumann boundary conditions are solved numerically using a stochastic Taylor expansion method. The impact of boundary noise on the system evolution is also discussed.     

基于随机相位调制的数字全息相移量提取方法

提出了一种在相移数字全息中提取相移角的方法.该方法通过在相移数字全息中引入随机相位板对物光波的相位进行调制,使得物光波在全息面上的相位分布成为近似理想的随机分布,进而根据这种随机分布的统计性质对相移角进行提取.计算机模拟结果表明,该方法提取出的相移角与设定的相移角之间的相对误差小于千分之一.同时,经过对比采用随机相位板和不采用随机相位板的计算结果发现,物体衍射光波在全息面上的相位分布具有一定的相关性.     

Stability in terms of two measures of solutions to stochastic partial differential delay equations with switching

In this paper, the problem of stability in terms of two measures is considered for a class of stochastic partial differential delay equations with switching. Sufficient conditions for stability in terms of two measures are obtained based on the technique of constructing a proper approximating strong solution system and conducting a limiting type of argument to pass on stability of strong solutions to mild ones. In particular, the stochastic stability under the fixed‐index sequence monotonicity condition and under the average dwell‐time switching are considered.