Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

一类暂留稳定过程的极限定理

本文研究了Ａ型暂留稳定过程在无穷远处的收敛速度，给出了一个重对数律．同时我们也得出了这类过程在起始点附近的一些性质．这些性质推广了［１］中的结果     

完备可分度量群上的齐次Levy过程的复合Poisson逼近

该文利用算子半群的方法给出了取值于具有左不变度量的完备可分群的齐次Levy过程是复合Poisson过程的弱极限这一结论．     

OU型Markov过程的不变测度及弱对偶性

本文研究ＯＵ型Ｍａｒｋｏｖ过程的不变测度、参考测度和弱对偶半群的存在性问题，并得出了不变测度的唯一性。     

GIRSANOV'S THEOREM ON ABSTRACT WIENER SPACES

ＧＩＲＳＡＮＯＶ’ＳＴＨＥＯＲＥＭＯＮＡＢＳＴＲＡＣＴＷＩＥＮＥＲＳＰＡＣＥＳＺＨＡＮＧＹＩＮＮＡＮＡｂｓｔｒａｃｔＬｅｔ（Ｅ，Ｈ，μ）ｂｅａｎａｂｓｔｒａｃｔＷｉｅｎｅｒｓｐａｃｅｉｎｔｈｅｓｅｎｓｅｏｆＬ．Ｇｒｏｓ．Ｉｔｉｓｐｒｏｖｅｄｔｈ...     

Computation of the quasi-stationary distributions inM(n)/GI/1/K andGI/M(n)/1/K queues

In this paper, we provide numerical means to compute the quasi-stationary (QS) distributions inM/GI/1/K queues with state-dependent arrivals andGI/M/1/K queues with state-dependent services. These queues are described as finite quasi-birth-death processes by approximating the general distributions in terms of phase-type distributions. Then, we reduce the problem of obtaining the QS distribution to determining the Perron-Frobenius eigenvalue of some Hessenberg matrix. Based on these arguments, we develop a numerical algorithm to compute the QS distributions. The doubly-limiting conditional distribution is also obtained by following this approach. Since the results obtained are free of phase-type representations, they are applicable for general distributions. Finally, numerical examples are given to demonstrate the power of our method.     

Stationary Distribution Function Estimation for Ergodic Diffusion Process

The problem of nonparametric stationary distribution function estimation by the observations of an ergodic diffusion process is considered. The local asymptotic minimax lower bound on the risk of all the estimators is found and it is proved that the empirical distribution function is asymptotically efficient in the sense of this bound.     

Vasicek债券定价模型的推广形式

V asicek债券定价模型假定即期利率r(t)遵循O-U过程,利率的长期均值θ为一个常数.对此进行推广,假设θ遵循一个离散跳跃过程,跳跃的次数与幅度由中央银行根据物价指数确定,建立一个新的模型.运用Ito引理和无套利原理给出到期日价值为1的零息票债券的定价公式.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.